<prompt> Ngola pseudocode bakeng sa algorithm ea Merge Sort.nan  <response>: Instruction in English: Write pseudocode for a Merge Sort algorithm. . Response in English: Here is the pseudocode for Merge Sort Algorithm: algorithm MergeSortarr, low, high if low high Find the middle point mid - low high 2 Recursively sort the two halves MergeSortarr, low, mid MergeSortarr, mid 1, high Merge the two sorted halves Mergearr, low, mid, high end ifend algorithmalgorithm Mergearr, low, mid, high n1 - mid - low 1 n2 - high - mid Create temporary arrays let left 1..n1 let right 1..n2 Copy data to temporary arrays left and right for i - 1 to n1 lefti - arrlow i - 1 end for for j - 1 to n2 rightj - arrmid j end for Merge the temporary arrays back into arrlow..high i - 1 j - 1 k - low while i n1 and j n2 if lefti rightj arrk - lefti i - i 1 else arrk - rightj j - j 1 end if k - k 1 end while Copy the remaining elements of left, if any while i n1 arrk - lefti i - i 1 k - k 1 end while Copy the remaining elements of right, if any while j n2 arrk - rightj j - j 1 k - k 1 end whileend algorithm . Response in Sesotho: Mona ke pseudocode bakeng sa Merge Sort Algorithm: algorithm MergeSortarr, low, high haeba e le tlase 