c) The path length of a tree T is the sum of the depths of all the nodes in T. Assume that the depth of any node in T is not known beforehand. Describe an algorithm in pseudo- code for computing the path length of a tree T (which is not necessarily binary). a) Two words are anagrams of each other if they differ only by the order of their characters. For example, "HATE and HEAT, NOW" and "WON, reset and steer are anagrams, but sell and less" are not. Write an algorithm to determine if two given words are anagrams