<prompt> hlahisa algorithm ho fumana moholo-holo ea tloaelehileng oa nodes tse peli sefateng sa binary.nan  <response>: Instruction in English: generate an algorithm to find the first common ancestor of two nodes in a binary tree. . Response in English: Heres an algorithm to find the first common ancestor of two nodes in a binary tree:1. Start at the root of the binary tree.2. If the root is equal to either of the two nodes, return the root as the first common ancestor.3. Recursively call the function for both the left and right children of the root.4. If the function returns a non-null value for both the left and right children, then the root is the first common ancestor. Return the root.5. If the function returns a non-null value for only one child, then return that non-null value as the first common ancestor. 6. If the function returns a null value for both children, return null. . Response in Sesotho: Mona ke algorithm ea ho fumana moholo-holo oa pele oa li-node tse peli sefateng sa binary: 1. Qala ho motso oa sefate sa binary. 2. Haeba motso o lekana le e ngoe ea li-node tse peli, khutlisetsa motso e le moholo-holo oa pele. 3. Bitsa tsebetso ka ho pheta-pheta bakeng sa bana ba bobeli le ba ho le letona ba motso. 4. Haeba tsebetso e khutlisa boleng bo sa hlokeng letho bakeng sa bana ba ka ho le letšehali le ba ho le letona, joale motso ke moholo-holo oa pele. Khutlisetsa motso. 5. Haeba tshebediso e kgutlisetsa boleng boo e seng ba lefeela bakeng sa ngwana a le mong feela, o kgutlisetse boleng boo e seng lefeela jwalo ka moholo wa pele. 6. Haeba tsebetso e khutlisa boleng ba lefeela bakeng sa bana ka bobeli, khutlisetsa null. 