You are given a binary tree that encodes a dynamic sequence of n elements. We would like to augment each node of the tree with a boolean field, named sameSubtree, that indicates true if the left and the right subtrees encode the same subsequence, false otherwise. In the figure below, a 1 indicates true, and 0 false. Note that the leaves are augmented with 1 since both their left and right subtrees are null, and that node 5 is also augmented with 1 since its left and right subtrees encode the same subsequence even though they are of different shapes. Given 17 10 the tree with no augmentations, please design and analyze an algorithm that can augment each node as described above. You may also augment each node with other information, for example, subtree sizes or heights, that may aid in augmenting sameSubtree