To improve the search efficiency of finding the closest shared ancestor between two fork nodes, the fork tree data structure is augmented by adding a parent node pointer to the CryptoForkNode class, devise an algorithm that: Given two fork nodes, in the worst$-$case scenario, the algorithm would take O$($h$)($h is the height of the tree$)$ time to locate the closest shared ancestor between the two fork nodes. $$ Write pseudo$-$code of findClosestSharedAncestor $($or C syntax code$)$ to describe the algorithm. $$ Present the worst$-$case scenario, and $$ Show the algorithm has an O$($h$)$ time complexity..