<prompt> Etsa algorithm ho fumana hore na palo e fanoeng ke ea bohlokoa.nan  <response>: Instruction in English: Design an algorithm to determine whether a given number is prime. . Response in English: A prime number is a natural number that is greater than 1 and is not divisible by any other number except for 1 and itself. Below is an algorithm to determine whether a given number is prime:Step 1: Take the input number, n from the user.Step 2: Initialize a variable isPrime to True.Step 3: If n is less than or equal to 1, assign False to the isPrime. and skip to step 9.Step 4: For each number i starting from 2 to the square root of n do the following:Step 5: Check whether n is divisible by i.Step 6: If n is divisible by i, then assign False to isPrime.Step 7: Break the loop.Step 8: End of for loop.Step 9: If the value of isPrime is True then display n is a prime number, else display the message n is not a prime number.Step 10: End. . Response in Sesotho: Nomoro e kholo ke nomoro ea tlhaho e kholo ho feta 1 me ha e aroloe ke nomoro efe kapa efe ntle le 1 le eona. Ka tlase ke algorithm ea ho fumana hore na nomoro e fanoeng ke ea bohlokoa: Mohato oa 1: Nka nomoro e kentsoeng, n ho tsoa ho mosebelisi. Mohato oa 2: Qala ho feto-fetoha isPrime ho ea ho True. Mohato oa 3: Haeba n e ka tlase ho kapa e lekana le 1, abela False ho isPrime. ebe u tlolela mohatong oa 9. Mohato oa 4: Bakeng sa nomoro e ngoe le e ngoe i ho qala ho tloha ho 2 ho ea ho square motso oa n. etsa tse latelang: Mohato oa 5: Hlahloba hore na n e aroloa ka i. Mohato oa 6: Haeba n e aroloa ka i, joale abela False ho isPrime. Mohato oa 7: Khaola sekoti. Mohato oa 8: Qetello ea ho loop. Mohato oa 9: Haeba boleng ba isPrime ke nete joale pontso n ke nomoro ea mantlha, ho seng joalo bontsa molaetsa n ha se nomoro ea mantlha. Mohato oa 10: Qetella. 