(a) Construct a Binary Search Tree (BST) for the given data
11, 9, 34, 6, 10, 20, 45, 0, 7, 38, 52, 46
Also write the pseudocode for the following;
i. Deleting a node in BST
ii. Adding a node in BST.
(c) Apply the following Union operation for disjoint set over the given data and construct the resultant tree.
20, 16, 25, 6, 17, 21, 29, 0, 7, 28, 51, 46
i. Union (20, 0) ii. Union (51, 46)
ii. Union (51, 46)
iii. Union (29, 28) iv. Union (25, 0)
iv. Union (25, 0)
v. Union (28, 20) vi. Union (17, 28)
vi. Union (17, 28)