Q. Compute the total number of operations required to convert one N-ary tree to another. \n```\nclass TreeNode {\n        String key;\n        int value;\n        List<TreeNode> children;\n    }\n\n```\n\nTree-1\n```\n               a(1)                                                \n            /       \\                                                          \n         b(2)       c(3)                                               \n        /     \\         \\                                                         \n      d(4)    e(5)      f(6)      \n```\n               \n\t\t\t   \nTree-2\n```\n            a(1)\n                \\\n               c(3)\n                   \\\n                   f(66)\n\n```\n\n\nOperations: \n1. b(2) was removed from Tree-1 (Count = 1)\n2. Childrens of b(2) are removed, i.e. d(4) & e(5) (Count += 2)\n3. f(6) was updated to f(66) in Tree-2 (Count += 1)\n\nTotal Operations done **(Count = 4)**

Q. Compute the total number of operations required to convert one N-ary tree to another. \n\nclass TreeNode {\n        String key;\n        int value;\n        