CDr$.$ Shawn X$.$ Wang

Problem $3(28\%)$ Given the following keys L$,$ A$,$ P$,$ G$,$ C$,$ N$,$ W$,$ B$,$ M$,$ Q$,$ F$,$ Y$,$ V$,$ T$,$ R$.$ Build a descendants$).$ Show your B$+$ Tree that results from loading the following sets of keys in order:

a$.L,A,P,G$

b$.L,A,P,G,C$

c$.L,A,P,G,C,N,W,B,M,Q,F,Y,V$

d$.L,A,P,G,C,N,W,B,M,Q,F,Y,V,T,R$

Problem $4(12\%)$ Given the B$+-$tree below, show the results of deleting A$,$ D$,$ I, and O$,$ individually and separately from the original tree.

Delete A

Delete D

Delete I

Delete $O$