For the binary tree, determine the precise number of memory cells needed to store. The representation of the total no of memory cells in the form of a table that is Address and contents. For e.g "B" will be stored in address 0, "E" will be stored in the address=?, G at the address=? and so on. Show all the address of C, I, D, H, F, K?