Previously we discussed how a linked list could be stored in an array of nodes using the index values as "pointers" and managing our list of free nodes. We can use the same techniques to store the nodes of a binary search tree in an array, rather than using dynamic storage allocation. Free space is linked through the left member. a. Show how the array would look after these elements had been inserted in this order: Q L W F M R N S b. Show the contents of the array after 'B' has been inserted and 'R' has been deleted