Given 2 trees T} and T2, where T1 has more nodes than T2, and where each of the nodes in both trees holds an integer value

Given 2 trees T} and T2, where T1 has more nodes than T2, and where each of the nodes in both trees holds an integer value. Further, the values in any of the trees are assumed to be unique (no duplicate values within the same tree). i) Give an algorithm that determines whether or not T2 represents a subtree of T1. ii) What is the time and space complexity of your algorithm in i)? iii) Will your algorithm still work if duplicate values are permitted in these trees? a. If your algorithm still works when duplicate values are allowed, explain clearly why this change could not have affected your solution. b. If your algorithm will fail if duplicate values are allowed, provide an example of the failure and propose some modi?cation to ?x this failure.