- describein detailthe insertion and removal algorithms for an ( ,btree - suppose is multi-way tree in which each internal node has at least five and at most eight children for what values of and is valid ( ,btreer- for what values of is the tree of the previous exercise an order- -treer- show each level of recursion in performing four-wayexternal-memory merge-sort of the sequence given in the previous exercise - consider an initially empty memory cache consisting of four pages how many page misses does the lru algorithm incur on the following page request sequence( , , , , , , , , , , , , ) - consider an initially empty memory cache consisting of four pages how many page misses does the fifo algorithm incur on the following page request sequence( , , , , , , , , , , , , ) - consider an initially empty memory cache consisting of four pages how many page misses can the random algorithm incur on the following page request sequence( , , , , , , , , , , , , )show all of the random hoices your algorithm made in this case - draw the result of insertinginto an initially empty order- -treeentries with keys ( , , , , , , , , , , , , , , , , , )in this order - show each level of recursion in performing four-way merge-sort of the sequence given in the previous exercise