4. Given a binary search tree below, answer the questions after it. 45 55 57 6:0 67 100 107 Create a C# program having the following operations: (1) Create this binary search in C#, and output the tree (9 points) (2) Perform the inorder, preorder, and postorder traversal operations, and then output the result of each traversal. (21 points) (3) Search the minimum node, and then output the result. (10 points)