python 3

Write the function Smallest(T) that return the smallest item in B-tree T. . Write the function NumItems(T) that returns the number of items stored in B-tree T. Write the function LargestAtDepthD(T,d) that returns the largest item at depth d in B-tree T, or math.inf if the tree has no nodes at depth d. 4. Write the method FindDepth(T,k) that receives a reference to the root ofa B-treeT and an item k and returns the depth of the node where k is found in the tree, or -l if k is not in the tree. . Write the function PrintAtDepthD(T,d) that prints, in ascending order, all the items in B-tree T that have depth d. Write the function Largest(T) that return the largest item in B-tree T. 6. Write the function NumLeafs(T) that returns the number of leaf nodes in B-tree T. 7. Write the function FullNodes(T) that returns the number of nodes in B-tree T that are full (a node is full if it 8. has max_items items). Write the function PrintDescending(T) that prints all the items in B-tree T in descending order. 9. 10. Write the method that receives a reference to the root of a B-tree T and an item k and prints all the items that are In the same node as k.