<prompt> Etsa lenaneo ho hlahloba hore na mashaka a khoele a leka-lekana.nan  <response>: Instruction in English: Create a program to check if the parenthesis of a string are balanced. . Response in English: Here is an example program written in Python to check if the parenthesis of a string are balanced:pythondef is_balancedstring: stack for char in string: if char : stack.appendchar elif char : if not stack or stack.pop ! : return False return not stack Test casesprintis_balanced True - balancedprintis_balanced True - balancedprintis_balanced False - unbalancedprintis_balanced False - unbalancedIn this program, we use a stack data structure to keep track of the opening parenthesis. If we encounter an opening parenthesis, we push it in the stack. If we encounter a closing parenthesis, we pop from the stack and check if it matches the opening parenthesis. In the end, if the stack is empty, then the parenthesis are balanced. Otherwise, it is unbalanced. . Response in Sesotho: Mona ke mohlala oa lenaneo le ngotsoeng ka Python ho hlahloba hore na mashaka a khoele a leka-lekane: python def is_balancedstring: stack bakeng sa char in string: if char : stack.append char elif char : haeba e se stack kapa stack.pop ! : kgutlisa Puseletso ya bohata ha se stack Maemo a diteko a hatiswae_balanced Nnete - khatiso e leka-lekanenge_e leka-lekane Nete - khatiso e leka-lekanenge_e leka-lekane Bohata - khatiso e sa leka-lekanange_e leka-lekane Bohata - e sa leka-lekanang Lenaneong lena, re sebelisa sebopeho sa data sa stack ho boloka tlaleho ea mashaka a qalang. Haeba re kopana le masakakana a butsoeng, re a sutumelletsa ka hara stack. Qetellong, haeba qubu e se na letho, joale masaka a leka-lekana. Ho seng joalo, ha a lekane. 