$[30$pts$]$ Perform the following sequence of operations in an initially empty splay tree and draw the tree after

each set of operations.

a$.$ Insert keys $0,2,4,6,8,10,12,14,16,18,$ in this order.

b$.$ Search for keys $1,3,5,7,9,11,13,15,17,19,$ in this order.

c$.$ Delete keys $0,2,4,6,8,10,12,14,16,18,$ in this order.