Merge and Serialize N-ary Trees

Two N-ary tree objects are provided. They must be combined into one tree and then converted to a portable string, and a parser must be able to reconstruct the tree from that string. The assignment deliberately leaves four decisions unspecified: how nodes are identified during a merge, how conflicting data on matched nodes is resolved, whether sibling order is significant, and the exact grammar of the serialized text. Your first task is to list these unresolved design…