Specify, design, and implement a class for complete binary trees using an array representation. You should have only one member function that adds a new node(since there is only one place where a node may be added, and one member function that removes the last node of the tree.