$1.(3$ points$)$ Write a program to create a balanced BST from an ordered array. For example,

Input: $012334567899$ Output:

$2.(3$ points$)$ Implement the deletion of a node from a BST by the copy method. Test your implementation by deleting a node from the BST in Problem $1.$ The node to be deleted should be inputted by user.

$3.(3$ points$)$ Implement the deletion in a BST by merging method. Test your implementation in a similar way to Problem $2.$