Given the following parameters: 1 Page on disk = 2048 bytes Disk access time = 1 milli-sec per byte Pointer = 4 bytes Key = 8 bytes Data = 512 bytes per record (includes key) What are the best values for M and L. b. Insert the following values in this order, into a B-tree where M = 3 and L =2. 8, 4, 6, 2, 3, 1, 7, 9