This is a data structure questions. Please include steps, including for the corrected answers, so I can review and practice. Thanks

1.4 Suppose a disk block stores 4096 bytes and the basic key size is 96 bytes. Assuming that pointers cost 4 bytes, what is the correct choice of M for a B-tree? a) 41 (c) 43 (d) 96 (e) none of the above 1.5 Iterms 7,3, 11, 9 and 13 are inserted into an AVL tree. What happens when 12 is inserted? a) No rotations is (b)A single rotation between (c) A single rotation between some node and its right child is performed some node and its left child is performed A double rotation with a node, its left child, and a third node is performed A double rotation with a nodes, its right child, and a third node is performed