<prompt> Ngola tšebetso ho hlahloba hore na palo e feletseng ke nomoro ea mantlha.nan  <response>: Instruction in English: Write a function to check if an integer is a prime number. . Response in English: Sure, here is a function written in Python that checks if a given integer is a prime number:pythondef is_primen: if n 1: return False for i in range2, n: if n i 0: return False return TrueThis function takes an integer n as an input and returns a boolean value indicating whether the integer is a prime number or not. The function checks if the integer is less than or equal to 1, and if so, it returns False because 1 is not a prime number.If the integer is greater than 1, the function enters a loop where it checks if the integer is divisible by any number from 2 to n-1. If it is divisible by any of these numbers, the function returns False, indicating that the integer is not a prime number. If the integer is not divisible by any of these numbers, the function returns True, indicating that the integer is a prime number. . Response in Sesotho: Ehlile, mona ke mosebetsi o ngotsoeng ho Python o hlahlobang hore na palo e fanoeng ke nomoro ea mantlha: python def is_primen: haeba n 1: return False for i in range2, n: haeba n i 0: kgutlisa Pusetso ya Bohata Nnete Tshebetso ena e nka palo kaofela n e le kenyeletso mme e kgutlisa boleng ba boolean e bontshang hore na nomoro ke palo e ka sehloohong kapa tjhe. Tshebetso e lekola hore na palo kaofela e ka tlase ho kapa e lekana le 1, me haeba ho joalo, e khutlisa False hobane 1 ha se nomoro ea mantlha. Haeba nomoro e le kholo ho feta 1, tšebetso e kenya lupu moo e hlahlobang hore na palo e feletseng e aroloa ka nomoro efe kapa efe ho tloha ho 2 ho ea ho n-1. Haeba e ka aroloa ka efe kapa efe ea linomoro tsena, tšebetso e khutlisa False, e leng se bontšang hore nomoro kaofela ha se palo e kholo. Haeba nomoro e sa aroloe ka efe kapa efe ea linomoro tsena, tšebetso e khutlisa Nete, e leng se bontšang hore nomoro e feletseng ke nomoro ea mantlha. 