Try inserting the following data using tries: d $=\{$apple$,$apricot$,$ appalling, aqua, aardwolf, bear, beach, baked, baron, zebra, zoo, zest$\}$outline the procedure in detail, After you've made the tree, delete the following words and demonstrate the process:

$1.$Appalling$,$

$2.$beach$,$

$3.$zest$.$

Do not apply delete operations on all the words at once

Clearly displaying the process for adding and removing data, with each step validated.