Design and implement tree insertion and deletion algorithms that use arrays for the names and left and right pointer sets. A linked free list should be used to keep track of unused storage. You should be able to design your algorithm such that only one procedure is needed to perform the role of the left sub tree and right sub tree procedures described above.