Perform the following operations on the given tree and write the preorder and post$-$order traversal of $(4)$ the final tree.

i$)$ Insert $46$

ii$)$ Insert $28$

iii$)$ Delete $26$

iv$)$ Delete $47$

v$)$ Delete $30$

vi$)$ Insert $49$