<prompt> Ho fanoe ka linomoro tse tharo, fumana karolo e kholo ka ho fetisisa e tloaelehileng ea ho arola gcd ea linomoro tse tharo.nan  <response>: Instruction in English: Given three numbers, find the greatest common divisor gcd of the three numbers. . Response in English: To find the greatest common divisor GCD of three numbers, you can use the Euclidean algorithm. This algorithm works by iteratively applying the following operation until the GCD is found:1. choose two of the three numbers, lets say a and b, such that a is greater than b2. replace a with the remainder obtained when a is divided by b3. swap a and bThen, apply the above operation to the two other pairs, that is, b and c and then a and c. When the three numbers become equal, they represent the GCD of the original numbers. You can also find the GCD of the three numbers more easily by using the following relation: gcda, b, c gcdgcda, b, c. This means you can first find the GCD of any two numbers and then find the GCD of their GCD and the third number.Here is an example Python code that implements the second method:pythonfrom math import gcddef find_gcda: int, b: int, c: int - int: return gcdgcda, b, cExample Usage:pythonprintfind_gcd10, 15, 20 5printfind_gcd14, 28, 35 7 . Response in Sesotho: Ho fumana karolo e kholo ka ho fetesisa e tloaelehileng GCD ea linomoro tse tharo, o ka sebelisa algorithm ea Euclidean. Algorithm ena e sebetsa ka ho pheta-pheta tsebetso e latelang ho fihlela GCD e fumanoa: 1. khetha linomoro tse peli ho tse tharo, ha re re a le b, hoo a e kholo ho feta b 2. le karolo e setseng e fumanweng ha a e arolwa ka b 3. swap a le b Ebe, sebedisa tshebetso e ka hodimo ho dipara tse ding tse pedi, e leng, b le c ebe a le c. Ha lipalo tse tharo li lekana, li emela GCD ea linomoro tsa pele. U ka boela ua fumana GCD ea linomoro tse tharo habonolo haholoanyane ka ho sebelisa kamano e latelang: gcda, b, c gcdgcda, b, c. Sena se bolela hore o ka qala ho fumana GCD ea linomoro leha e le life tse peli ebe o fumana GCD ea GCD ea bona le nomoro ea boraro. Mohlala ke ona khoutu ea Python e sebelisang mokhoa oa bobeli: python ho tsoa ho math import gcd def find_gcda: int, b: int, c: int - int: return gcdgcda, b, c Mohlala oa Tšebeliso: python printfind_gcd10, 15, 20 5 printfind_gcd14, 28, 35 7 