Please answer the following question and all it\'s parts. Please explain your answer as well! Thank you in advance for your hardwork! 2) For a 7-way B-tree, answer the following questions (1 point each) Assignment 4 Heap, Huffman Coding Tree, Multiway Trees Due Date: 9:30am, Dec. 1 (Hard and E-copy) a) How many keys should each node be able to hold at maximum? b) What is the minimum number of children an internal node, other than the root, have? c) What is the maximum number of children can an internal node have? Solution In an n-way binary B-tree each node has n children and n-1 keys each node other than root and leaf nodes have atmost m non empty children and atleast [m/2] non empty children. a) 6 keys should each node be able to hold at maximum b) minimum 4 children can an internal node must have c) maximum 7 children.