I need sequence 3

Assignment 7.42 Spring 2018 CISP 430 You will perform graphical hand executions on B trees. Sequence 1) Hand-nsert the following sequence of keys into an initially empty B-Tree of ORDER 1, which means the root has 1 to 2 elements, and each child has 1 to 2 elements: 1,2, 3,4,9, 8,7,6,5 Sequence 2) t the following sequence of keys into an initially empty B-Tree of ORDER 2, which means the root has 1 to 4 elements, and each child has 2 to 4 elements: 20, 30, 40, 50, 60, 70, 80, 90, 45, 55, 65, 15, 25, 35, 75, 85, 95 Sequence 3) Hand-insert the following sequence of keys into an initially empty B-Tree of ORDER 4, which means the root has 1 to 8 elements, and each child has 4 to 8 elements: 20.30. 40.50. 60.70.80. 90.4,5.8, 13 23.38, 76.85, 95.31.31.41, 51,61, 71,81,01.46, 56,66, 16, 26, 36, 76, 86, 96,22, 32,42,52,62, 72,82,92, 47, 57, 67, 17, 27, 37, 77,87,97 You MUST show all your work. Turn in: Lots of paper with lots of NEATLY COMPUTER DRAWN diagrams. Show all your work, including Indicate the keys that are added to each node. Show any values that are moved in the arrays Show the tree before and after each split. Indicate the keys that are moved when a node is split. 1) 2) 3)