Please give me a very detailed algorithm for the following requirements. I dont need the code, just the algorithmic. implement a binary search tree from scratch $($i$.$e$.,$ no use of predefined coding routines to perform tree actions$).$Have the output be similar to the attached picture especially for the duplicate numbers $($ like $9$ and $25).$ Your program will then process a file of searches, inserts and deletes from the trees. The file will contain an action code: S search, I insert, and D$-$ delete $($what if it isnt one of those????? error message Invalid Action Code and continue$)$ and the number of operations for that action.Display the action and value and what tree looks like after the action takes place. You are also to print the number of operations to perform the action. Please help me as I would greatly appreciate it$.$