Anary tree is defined ning the data structure reported below. Nodes have a strong as a key, anda beli n child the army child individuates these children pode et node node shat node char "hery in child node t child anda For each tree, there is a corresponding set of paths, which is the set of all paths starting from the root and reaching a leaves Two trees are defined to be equivalent if and only if they generate exactly the same set of paths For example, the leftmost tree and the one in the middle are equivalent but the rightmost is not. The two trees on the len hand side of the picture generate the following set of paths: [ABE, ABF, ABG, AC, ADHL, ADI). On the contrary, the nightmost tree generates the set of paths: {ACE, ACF, ACG, AD, ABHL, ABI). Notice that, in this example, all keys are single characters only for the sake of mutual understanding. More generally, keys are strings of unknown tength Write the function Write the function int que nouo mottok 1002) to verify whether two trees are equivalent or not. The function must retum 1 at the two trees are equivalent they do gerente same set of paths) and must return o, otherwise Notice that it is not advised to store the entire set of paths generated by a tree to solve the problem. Moreover, queda function whose cost is linear in the size of the trees passed as parameters. Less time effective of memory effective solution w be penalized