-treesb-trees are balanced trees that are optimized for situations when part or the entire tree must be maintained in secondary storage such as magnetic disk notes self assessment choose the appropriate answers -tree has minimum number of allowable children for each node known as the (aminimization factor (bmaximization factor (coperational factor (dsituational factor binary tree is special type of tree having degree ( ( ( ( fill in the blanks the search operation on -tree is to search on binary tree is collection of data organized in fashion that facilitates updatingretrievingand managing the data -tree is kept balanced by requiring that all leaf nodes are at the same the operation creates an empty -tree by allocating new root node that has no keys and is leaf node state whether the following statements are true or false deletion of key from -tree is possible -trees do not shrink when keys are deleted the lower and upper bounds on the number of child nodes are typically fixed for particular implementation to perform an insertion on -treethe appropriate node for the key must be located using an algorithm similiar to -tree-search review questions generalize the amortized analysis given in the text for incrementing four-digit binary integers to -digit binary integers describe the deletion of an item from -trees describe of structure of -tree also explain the operation of -tree explain how will you insert an item in -trees lovely professional university