<prompt> Ngola tšebetso ho bala palo e kholo ka ho fetesisa e tloaelehileng GCD ea linomoro tse peli.nan  <response>: Instruction in English: Write a function to calculate the greatest common divisor GCD of two integers. . Response in English: Sure! Heres a Python function that uses the Euclidean Algorithm to calculate the GCD of two integers:pythondef gcda, b: whileb: a, b b, a b return absaThis function takes in two integer arguments, a and b, and calculates their GCD using the Euclidean Algorithm. The while loop iteratively replaces a with b and b with a modulo b until b becomes zero. At that point, the absolute value of a is returned as the GCD of the two input numbers. . Response in Sesotho: Ehlile! Mona ke tsebetso ea Python e sebelisang Euclidean Algorithm ho bala GCD ea linomoro tse peli: python def gcda, b: whileb: a, b b, a b return absa Tsebetso ena e nka likhang tse peli tse felletseng, a le b, me e bala GCD ea bona e sebelisa Euclidean Algorithm. Loop ya nakong e fetola a ka b le b ka a modulo b ho fihlela b e fetoha lefela. Ka nako eo, boleng bo felletseng ba a bo khutlisoa e le GCD ea linomoro tse peli tse kentsoeng. 