Please answer the question in its entirety and make it copyable

Question 4: Draw a binary search tree for the 12-element array generated to capture your screenshot for Question 3 and illustrate the execution of the algorithm with your testKey as shown in the example below. For each node visited in the BST, you should show the estimated values for the minimum absolute difference between the testKey and the nodes in the BST as well as the estimated values for the closestKey Example for the BST-based Approach (test integer: 50") 0 1 23 4 5 67 12 23 25 33 45 46 56 78 Node Data Abs. Diff Min. Abs. with 50" Diff with "50" Closest Integer 50" 3350" 17 17 23 46 46 46 50" 12 25) (45 5656 6 46 50 STOPII 78 Question 4: Draw a binary search tree for the 12-element array generated to capture your screenshot for Question 3 and illustrate the execution of the algorithm with your testKey as shown in the example below. For each node visited in the BST, you should show the estimated values for the minimum absolute difference between the testKey and the nodes in the BST as well as the estimated values for the closestKey Example for the BST-based Approach (test integer: 50") 0 1 23 4 5 67 12 23 25 33 45 46 56 78 Node Data Abs. Diff Min. Abs. with 50" Diff with "50" Closest Integer 50" 3350" 17 17 23 46 46 46 50" 12 25) (45 5656 6 46 50 STOPII 78