Question #5: [8 marks] if you know in advance that you often access a given item in a binary search tree several times in succession before accessing a different item, you will end up searching for the same item repeatedly. One way to avoid this problem is to add an extra book keeping component to your implementation. That is, you can maintain a last accessed pointer that will always reference the last item that any binary search tree operation accessed. Whenever you perform such an operation, you can check the search key of the item most recently accessed before performing the operation. Revise and write only declaration of class for the implementation of the ADT binary search tree to add this new feature by adding the data member lastAccessed to the class and writing declarations/prototypes of its necessary functions. Also give the definition of find/search function according to the declaration you have written