<prompt> Ngola algorithm ho fumana mateano a litsela tse peli.nan  <response>: Instruction in English: Write an algorithm to find the intersection of two arrays. . Response in English: To find the intersection of two arrays, you can follow these steps:1. Create an empty list called result to store the intersection elements.2. Use a loop to go through all elements of the first array.3. For each element in the first array, check if it is also present in the second array.4. If the element is present in both arrays, append it to the result list.5. After going through all elements in the first array, return the result list.pythondef intersectionarr1, arr2: result for elem in arr1: if elem in arr2: result.appendelem return result . Response in Sesotho: Ho fumana mateano a litsela tse peli, u ka latela mehato ena: 1. Etsa lethathamo le se nang letho le bitsoang sephetho ho boloka likarolo tsa mateano. 2. Sebelisa loop ho feta likarolo tsohle tsa sehlopha sa pele. 3. Bakeng sa elemente ka ngoe lethathamong la pele, hlahloba hore na le eona e teng lethathamong la bobeli. 4. Haeba element e le teng ka lihlopha tse peli, e kenyelle lethathamong la sephetho. 5. Kamora ho sheba likarolo tsohle tsa sehlopha sa pele, khutlisetsa lenane la sephetho. python def intersectionarr1, arr2: sephetho bakeng sa elem ho arr1: haeba elem in arr2: result.appendelem sephetho sa ho khutla 