<prompt> Ngola tsebetso ea Python ho fumana hore na palo ke ea mantlha.nan  <response>: Instruction in English: Write a Python function to determine if a number is a prime. . Response in English: Here is an example of a Python function that can determine if a number is prime:pythondef is_primen: if n 1: return False elif n 2: return True else: for i in range2, n: if n i 0: return False return TrueThis function takes an integer n as input and returns True if it is a prime number and False otherwise. It works by first checking if the number is less than or equal to 1, in which case it is not prime. If the number is 2, it is considered prime. For all other numbers, the function checks if the number is divisible by any integer in the range from 2 to n-1. If any such number is found, it means that n is not a prime number, and the function returns False. If no such number is found, n is considered a prime number, and the function returns True. . Response in Sesotho: Mohlala ke ona oa tšebetso ea Python e ka tsebang hore na nomoro ke ea mantlha: python def is_primen: haeba n 1: return False elif n 2: return True else: for i in range 2, n: haeba n i 0: kgutlisetsa Poelo e fosahetseng Nnete Tshebetso ena e nka palo e feletseng n e le kenyo mme e busetsa Nete haeba e le nomoro e ka sehloohong le False ho seng joalo. E sebetsa ka ho hlahloba pele hore na palo e ka tlase ho kapa e lekana le 1, moo e seng ea bohlokoa. Haeba palo e le 2, e nkoa e le ea bohlokoa. Bakeng sa linomoro tse ling kaofela, tšebetso e hlahloba hore na palo e ka aroloa ka nomoro efe kapa efe ho tloha ho 2 ho ea ho n-1. Haeba nomoro e joalo e fumanoa, ho bolela hore n ha se nomoro ea mantlha, me mosebetsi o khutlisa False. Haeba nomoro e joalo e sa fumanwe, n e nkuwa e le nomoro e ka sehloohong, mme mosebetsi o kgutlisa Nnete. 