7. Consider the following list of numbers (input from left-to-right): 13957 12231461 (a) Create the ordered binary tree, in other words print the binary tree with the above insertion of nodes step- by-step. b) List the precorder travernsal of the tree. (c) List the inorder traversal of the tree. 8. Consider the following tree traversals: preorder: YEBAMDILRXTSOU inorder: ABMEIDYXRTLOSU (a) Create the binary tree, in other words print the binary tree that is represented by the above two traversals. (b) List the postorder traversal of the tree. 9. Consider the following list of numbers (input from left-to-right): 13 95 7 12 2 3 146 1 10 15 8 Create the 2-3 tree, showing all intermediate steps, in other words print the binary tree step-by-step. 10. Consider the following list of numbers (input from left-to-right): 12345678910 (a) Create the heap, showing all intermediate steps, in other words print the binary tree step-by-step. (b) Show the heap's array representation. I l. Sort the following list of numbers using the Shell Sort (with k = 3). Show all work. 13 9 5 7 122 3 14 6 1 12. Sort the following list of numbers using the quicksort. Show all work: 13 9 5 7 12 2 3 14 6 1 13. Sort the following list of numbers using the heap sort. Use the array representation of the heap. Show all work: 13 9 5 7 122 3 14 6 1