1) Make a FindMaxDepth method / This function will find the longest depth of the tree (the distance between the root node and the last leaf node), the input that the function will take is: (graph, rootNode) and the output will be a numeric value.

Example: If the following graph is entered and the startNode = A, the output must be 4

B D E TI F G