<prompt> Kubuni algorithm kutatua tatizo lifuatalo: Kutokana na NxN matrix, kupata ndogo namba kamili chanya kukosa kutoka kwake.  <response>: Here is one approach to find the smallest positive integer missing from an NxN matrix:1. Initialize a set to keep track of all the positive integers present in the matrix.2. Iterate through each element in the matrix: a. If the element is a positive integer, add it to the set.3. Initialize a variable missing to 1, representing the smallest positive missing integer.4. Loop while True: a. Check if missing is present in the set. b. If it is present, increment the value of missing by 1. c. Otherwise, break out of the loop.5. Return the value of missing as the result.Here is an example implementation of the algorithm in Python:pythondef findSmallestMissingmatrix: presentIntegers set for row in matrix: for element in row: if element 0: presentIntegers.addelement missing 1 while True: if missing not in presentIntegers: break missing 1 return missing 