<prompt> Ngola algorithm ho fumana linomoro tsa mantlha tse tlase kapa tse lekanang le palo e fanoeng n.nan  <response>: Instruction in English: Write an algorithm to find all prime numbers less than or equal to a given integer n. . Response in English: 1. Start by defining a function get_primesn that takes an integer n as input.2. Initialize an empty list prime_list to store prime numbers.3. Create a list is_prime of length n 1 with all items as True. This list will be used to check if a number is prime or not.4. Set the first two elements in the list is_prime0 and is_prime1 to False as 0 and 1 are not prime numbers.5. Iterate through x from 2 to n, do the following: 1. If is_primex is True, then x is a prime number. Append x to the prime_list. 2. Set all the multiples of x in the list is_prime starting from xx to n as False. You can use a loop to achieve this.6. Return prime_list as the list of all primes less than or equal to n. . Response in Sesotho: 1. Qala ka ho hlalosa tshebetso get_primesn e nkang palo kaofela n joalo ka kenyeletso. 2. Qala lenane le se nang letho lethathamo_la-kholo ho boloka linomoro tsa mantlha. 3. Etsa lenane ke_kholo la bolelele ba n 1 ka lintho tsohle e le Nete. Lenane lena le tla sebelisoa ho lekola hore na nomoro ke ea mantlha kapa che. 4. Beha likarolo tse peli tsa pele lenaneng ke_kholo0 le ke_kholo1 ho Mahata joalo ka 0 le 1 ha se linomoro tsa mantlha. 5. Pheta ho ya ho x ho tloha ho 2 ho ya ho n, etsa tse latelang: 1. Haeba ke_primex e le Nete, jwale x ke palo e kgolo. Kenya x ho lenane_la_ka sehloohong. 2. Beakanya dipuisano tsohle tsa x lenaneng ke_kholo ho qala ho tloha xx ho ya n jwalo ka False. U ka sebelisa loop ho fihlela sena. 6. Khutlisetsa lenaneo_la_ka sehloohong e le lenane la lihlooho tsohle tse ka tlase ho kapa tse lekanang le n. 