5] - Starting from the code from #2 in the practice section, insert the remaining nodes 1,4 , and 10 , from the figure: 6] Continuing the code from \#3 in the practice section, modify the function searchTree to also print the keys in all the nodes traversed in the search process Test with the existing keys 5,12 , and 7 , and also with 10,0, and 20. 7] Continuing the code from \#6 above, write a new function searchTreeDepth to return the depth at which the key was found. - The root has depth zero. - If the key is not found, the function should return -1