Given an adjacency matrix 1- Check if the adjacency matrix represents a m-ary unrooted tree m>=2. Otherwise terminate. 2- Allow the user to choose a node as the root. 3- Convert the m-ary tree in the adjacency matrix to a binary tree in a binary tree data structure taking the node chosen by the user as the root. 4- If the tree is not balanced, traverse the tree inorder and insert the traversed nodes in a Balanced Binary search tree (AVL tree). 5- Traverse the final AVL tree in preorder, inorder and postorder fashions.

Given an adjacency matrix 1- Check if the adjacency matrix represent

1.	Given an adjacency matrix 1- Check if the adjacency matrix represents a m-ary unrooted tree m>=2. Otherwise terminate. 2- Allow the user to choose a node as the root. 3- Convert the m-ary tree in the adjacency matrix to a binary tree in a binary tree data structure taking the node chosen by the user as the root. 4- If the tree is not balanced, traverse the tree inorder and insert the traversed nodes in a Balanced Binary search tree (AVL tree). 5- Traverse the final AVL tree in preorder, inorder and postorder fashions.
Answer» i DONT knowExplanation: