do in c# if required to code otherwise answer

Question 3: Binary Search Trees (19 marks) a) 6 marks) Show three ways that the values 10, 20, 30, 40 and 50 can be inserted into an initially empty binary search tree in order to yield a binary tree of maximum depth. b) (2 marks) Remove any non-leaf value from one of your binary search trees in part a). Show the resultant tree. (11 marks) Using the properties of the Node class and the root of the BinarySearchTree class given below, implement the method MaximumDepth which returns true if the current binary search tree has maximum depth; false otherwise. c) class Node Left get; set; public Node Right iget; set; \ get; set; class BinarySearchTreeT private Node T root; public bool MaximumDepth) ...)