Python language

9. Consider an initially empty B-tree with t-3. Draw the B-tree that would result from the following sequence of insertions: 1,2, 3, 4, 5, 6,7, 8, 9, 10, 11. 10. Wiries function tht ys in a brie 11Write a method that receives a reference to the root of a B-tree and an integer d and returns the smallest key in the tree that has depth d, or -1 if there are no keys at depth d. 12. Write a method that receives a reference to the root of a B-tree and an integer d and returns the sum of all the keys in the tree that have depth d. 13. Write a method that receives a reference to the root of a B-tree and a key k and returns 1 if k is in an internal node in the tree, 0 if k is in a leaf in the tree, or -1 if k is not in the tree