Q$2.$ Insert, into an empty binary search tree, entries with key $($operator$,$ if

$,$else,switch,for,break,continue,start,for,true,float,void,int $($in this order$).$Draw the

Binary search Tree after each insertion.