Insert the fоllоwing items intо а B Tree with n = 3 аnd l = 2: 8, 6, 3, 1, 9, 4, 5, 0, 2 Note thаt the elements are inserted in the aforementioned order. State the left to right level order traversal of the tree separated by spaces, e.g. 2 1 3 n = maximum children a node can have l = maximum keys a leaf node can have