<prompt> Ho fanoe ka lintlha tse peli tsa A le B, ngola lenaneo la ho fumana karolo e kholo ka ho fetisisa ea ho arola GCD pakeng tsa bona.A 36 B 48  <response>: Instruction in English: Given two integers A and B, write a program to find the greatest common divisor GCD between them. . Response in English: To calculate the GCD of two numbers, we can use the Euclidean algorithm. This algorithm works by repeatedly replacing the larger of the two numbers with its remainder when divided by the smaller of the two.Here is a Python program that implements this algorithm and finds the GCD between the given two integers A and B:pythondef gcdA, B: while B: A, B B, A B return AA 36B 48result gcdA, BprintfThe GCD of A and B is resultWhen we run this program, it returns the following output:The GCD of 36 and 48 is 12This means that 12 is the greatest common divisor of the two given numbers, 36 and 48. . Response in Sesotho: Ho bala GCD ea linomoro tse peli, re ka sebelisa algorithm ea Euclidean. Algorithm ena e sebetsa ka ho pheta-pheta sebaka se seholo sa linomoro tse peli le se setseng ha se aroloa ke tse nyane ho tse peli. Mona ke lenaneo la Python le sebelisang algorithm ena me le fumana GCD pakeng tsa lipalo tse peli tse fanoeng A le B: python def gcdA, B: ha B: A, B B, A B khutlela AA 36 B 48 sephetho gcdA, B printfGCD ea A le B ke sephetho Ha re tsamaisa lenaneo lena, le khutlisetsa tlhahiso e latelang: The GCD ea 36 le 48 ke 12 Sena se bolela hore 12 ke karohano e kholo ka ho fetisisa ea linomoro tse peli tse fanoeng, 36 le 48. 