2. Consider the binary search tree in question(1). Draw the final tree only if each of [05] the following operations is applied (successively) to the original tree. i) Node 20 is added iii) Node 40 is deleted iv) Node 50 is deleted 2. Consider the binary search tree in question(1). Draw the final tree only if each of [05] the following operations is applied (successively) to the original tree. i) Node 20 is added iii) Node 40 is deleted iv) Node 50 is deleted