1. Write an algorithm that determines whether or not two binary trees are equivalent. 2. Given two (dictionary) words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Example: Given "foo", "app"; returns true we can map 'f' -> 'a' and 'o' -> 'p' Given "bar", "foo"; returns false we can't map both 'a' and 'r' to 'o' Given "turtle", "tletur";