<prompt> Theha algorithm e khutlisetsang linomoro tsohle tse ka sehloohong ho ea ho nomoro e itseng ea ho kenyanan  <response>: Instruction in English: Create an algorithm that returns all prime numbers up to a certain input number . Response in English: Assuming the input is a positive integer n, here is an algorithm in python that returns all prime numbers up to n:pythonfrom math import sqrtdef primesn: if n 0 or n1: return Empty list since 0 and 1 are not primes else: initialize list of primes with 2, which is the first prime number primes_list 2 Check if subsequent integers until n are primes for num in range3,n1: initialize is_prime flag as true is_prime True check if number is divisible by any integer up to the integers square root for i in range2,intsqrtnum1: if numi 0: is_prime False break if is_prime flag is still true after the checking, add integer to the prime list if is_prime: primes_list.appendnum return primes_list . Response in Sesotho: Ho nka hore kenyelletso ke palo e nepahetseng ea n, mona ke algorithm ho python e khutlisetsang linomoro tsohle tsa mantlha ho ea ho n: python ho tloha ho math import sqrt def primesn: haeba n 0 kapa n1: return Lethathamo le se nang letho ho tloha ha 0 le 1 e se li-primes tse ling: qala lenane la li-primes ka 2, e leng lenane la palo-kholo ea pele 2 Sheba hore na lipalo tse latelang ho fihlela n ke li-primes bakeng sa num in range3,n 1: initialize is_prime flag as true is_prime Nnete hlahloba hore na nomoro e ka arolwa ka palo efe kapa efe ho fihla ho palo ya sekwere motso bakeng sa i in range2,intsqrtnum1: haeba numi 0: is_prime Phomolo ea bohata if is_prime flag e ntse e le nete ka mora ho hlahlojoa, eketsa palo e feletseng ho lenane la sehlooho haeba e le_le_kholo: primes_list.appendnum return primes_list 