Figures 8.16 and 8.17 illustrate how a binary tree can be stored in an array without using any pointers. Use this same system to store the following tree in an array. Put the root cell's data into array element 1, and then use as many elements as necessary to store the tree. If there are cells that are to remain empty, indicate that empty cell with an underscore character, '_'. Be sure to show the indices of your array, in a manner similar to Figures 8.16 and 8.17.

M

/ \

F R

/ \ \

B C V

1	2	3	4	5	6	7