This question is concerned with hashing with open addressing, where the table size is $10($indexed from $0$ to $9)$ and the $($linear$)$ probing sequence is defined byh$($k$)=$ k mod $10$ andh$($k$,$ i$)=($h$\text{'}($k$)+$ i$)$ mod $10.$Assume that the content of the hash table T is as follows:T$[0]=49$T$[1]=1$T$|2]=$ NILT$[3]=$ NILT$[4]-$ DELETEDT$[5]=25$T$|6]=$ DELETED$117-36118]=64$T$|9]=9$Answer these questions please

A$)$ The first cell $($index to the table$)$ probed by Hash$-$Search$($T$,84)$ is

B$)$ The second cell $($index to the table$)$ probed by Hash$-$SearchT, $84)$ is

C$)$ The first cell $($index to the table$)$ probed by Hash$-$Insert$($T$,19)$ is

D$)$ The second cell $($index to the table$)$ probed by Hash$-$Insert$($T$,19)$ is

E$)$ How many cells does Hash$-$Delete$($T$,49)$ probe?Please note that this question does not ask which cell is probed? It asks about HOW MANY.