A B-tree of order 6 contains 17 records. The keys of the records are
12, 14, 27, 28, 41, 49, 54, 67, 72, 84, 96, 107, 132, 146, 151, 154,
180
The tree has three levels(the root and two levels below). Draw the
tree. Draw it also as it appears after each operation in the following
sequence:
(a)	Delete record  with key 72
(b)	Delete record with key 67
(c)	Delete record with key 27
(d)	Insert record with key  155























The following figure is a B-tree of order 3, with x’s marking the
locations of the records. The tree in fact holds records with the
following single-character keys: 

P, Y,A,Q,F,W,J,T,B,L,M,D,U 

a) Draw the tree, showing where each record would appear. 
b) Draw the relevant parts of the tree as they would appear after 
each step in the following sequence of operations. 
(1) Insert record with key X. 
(2) Delete record with key Q. 
(3) Delete record with key M. 
(4) Insert record with key C.