Project subject: A tree application where student names are storedThe requirements and scoring are as follows$\mathrm{.}1-$ Inserting names into the tree $(60$ points$)$The names entered by the user must be inserted into a tree, starting with the first letter. Each letter is stored in a node. The same prefix shared betweendifferent names are represented by the same nodes. The number of names overlapped in a node must be kept in this node.For example, Figure I shows a tree which is initially empty. Figure $2,$ Figure $3,$ Figure $4,$ Figure $5$ and Figure $6$ represent the tree after the names "Ali"."Ay$$e$",$ "irfan","Alihan" and "Alican" were inserted, respectively.For example, considering the node $($A:$2)$ in Figure $3,$ it is understood that this node represents the letter $"$A$"$ and it is associated with $2$ names. Similarly.considering the node $($:$3)$ in Figure $6,$ it is understood that this node represents the letter $"$ and it is associated with $3$ names$\mathrm{.}2-$ Updating the names $(40$ points$)$The user may want to update a name at any stage. For example, a command such as Update$("$Alihan$",$ Veli"$)$ means that the name "Alihan" is wanted tobe updated as the name "Veli". Figure $7$ represents the tree after this update was made. If the name to be updated is not found in the tree, the user must beinformed.KOKFigure l:EmptyTreeKOHi:$1$Figure $2$:Afterinserting"Ali" intothe treei:$1$E:$1$Figure $3$: Afterinserting $"$Ay$$e$"$into the treeA:$2$KokN:$1$E:$1$N:$1$Figure $4$: After inserting"Irfan" into the treeY:$1$S:$1$H:$1$A:$1$N:$1$KokKokY:$1$N:$1$Figure $5$: After inserting"Alihan" into the treeFigure $7$:Tree after Update$("$Alihan$",$ "Veli"$)$A:$1$N:$1$N:$1$KokR:$1$N:$11/3$Figure $6$: After inserting "Alican" intothe tree$2/3$