<prompt> Ngola algorithm e hlahlobang hore na nomoro e fanoeng ke ea bohlokoa.7  <response>: Instruction in English: Write an algorithm that checks if the given number is prime. . Response in English: Here is one possible algorithm that checks if the given number n is prime:1. If n is less than 2, return False. Only integers 2 and above can be prime.2. If n is equal to 2, return True. 2 is the smallest prime number.3. Check if n is divisible by 2. If it is, return False. All even numbers above 2 are not primes.4. For all odd numbers i from 3 to the square root of n, do the following: a. Check if n is divisible by i. If it is, return False. If a number can be divided by another number, it is not prime.5. If the algorithm has not returned False so far, return True. The number is not divisible by any number other than 1 and itself, so it is prime.Using this algorithm for the given input of 7, we get the following results:1. 7 is greater than 2, so we move to the next step.2. 7 is not equal to 2, so we move to the next step.3. 7 is not divisible by 2, so we move to the next step.4. The largest odd number i to check is the square root of 7, rounded down to the nearest integer, which is 2. Since we have already checked divisibility by 2, there are no more numbers to check in this loop.5. Since the number has not been shown to be divisible by any number other than 1 and itself, the function returns True. So, the given number 7 is a prime number. . Response in Sesotho: Mona ke algorithm e le ngoe e ka bang teng e lekolang hore na nomoro e fanoeng n ke ea mantlha: 1. Haeba n e ka tlase ho 2, khutlisetsa Bohata. Linomoro feela 2 ho ea holimo li ka ba tokomane. 2. Haeba n e lekana le 2, khutlisetsa Nete. 2 ke palo e nyane ka ho fetisisa. 3. Sheba hore na n e aroloa ka 2. Haeba e le eona, khutlisa Flse. Linomoro tsohle tse lekanang ka holimo ho 2 ha se li-primes. 4. Bakeng sa linomoro tsohle tse sa tloaelehang i ho tloha ho 3 ho ea ho square root of n, etsa tse latelang: a. Sheba hore na n e arohanngoa ke i. Haeba ho joalo, khutlisetsa Bohata. Haeba palo e ka aroloa ka nomoro e ngoe, ha se ntho e ka sehloohong. Palo ha e aroloe ka nomoro efe kapa efe ntle le 1 le eona ka boeona, kahoo ke eona e ka sehloohong. Ho sebelisa algorithm ena bakeng sa tlhahiso e fanoeng ea 7, re fumana liphetho tse latelang: 1. 7 e kholo ho feta 2, kahoo re fallela mohato o latelang. 2. 7 ha e lekane le 2, kahoo re fetela mohatong o latelang. 3. 7 ha e arohane ka 2, kahoo re fetela mohatong o latelang. 4. Nomoro e kholo ka ho fetisisa e sa tloaelehang i ho hlahloba ke square root ea 7, e pota-potiloeng ho ea ho palo e haufi e haufi, e leng 2. Kaha re se re hlahlobile karohano ka 2, ha ho sa na linomoro tsa ho hlahloba loop ena. 5. Kaha nomoro ha e so bontšoe hore e ka aroloa ke nomoro efe kapa efe ntle le 1 le ka boeona, tsebetso e khutlisa Nete. Kahoo, nomoro e fanoeng 7 ke nomoro ea mantlha. 