1) Identify a type of decision tree that can be converted into a binary tree. Provide a conversion algorithm and its computational complexity analysis. 2) Implement the algorithm in any programming language and provide the full code, input file, instructions on how to run it, and screenshots documenting the transformation of a non-binary tree into a binary one. Note: You are free to choose how to implement the tree (e.g., an array, linked list, etc.), but you must include an explanation of your choice.
