b) Describe an algorithm that decides, given any two binary trees T, and 7,, whether the tree T, equals a subtree of the tree T. Forexample, in the diagram shown below, the top two trees illustrate...

Extracted text: b) Describe an algorithm that decides, given any two binary trees T, and 7,, whether the tree T, equals a subtree of the tree T. Forexample, in the diagram shown below, the top two trees illustrate the scenario where the tree T, is a subtree of the binary tree T,; the bottom two diagrams illustrate the scenario where the tree T, is NOT a subtree of the binary tree 72. 10 11 Tree Ti rooted at 6 Tree T2 Zhe tree T1 rooted at i ia a subtrea of the binary tree T2 that is rooted at 4. 10 11 1. 11 Trae TI roatad at 6 Tree T2 The tree Ti rooted at 6 is a MOT a subtree of the binary tree T2 that is rooted at 4. c) Analyze the running time complexity of the algorithm. d) Describe a o(nlgn)-time algorithm that, given a set s of n integers and another integer x, determínes if there exist two elements in s whose sum is exactly x.