answer doesnt have to be complex. it is enough to written just those elements in a SortedList ADT

3. [40] A Binary Search Tree (BST) ADT with the elements in order {B, F, D, H, A,K, E} is already available. Write a program to read these elements and insert in a SortedList ADT implemented in an array. Put commands on lines. Explain your program. 3. [40] A Binary Search Tree (BST) ADT with the elements in order {B, F, D, H, A,K, E} is already available. Write a program to read these elements and insert in a SortedList ADT implemented in an array. Put commands on lines. Explain your program