Can someone explain the below problem to me? I am reading about decision trees and binary trees and trying to build an algorithm for it.

Trees are key structures in many applications. For example, decision tools are often implemented as decision trees. Explain if and how a non-binary decision tree can be converted into a binary one. Include the following:

1. A formal statement regarding the possibility of converting a non-binary tree into a binary one

2. A proof of the above or a counter-example (produce a tree that cannot be converted)

3. Identify a type of decision tree that can be converted into a binary tree. Provide a conversion algorithm and its computational complexity analysis.

4. Implement the algorithm in your favorite 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.