any help?

Some software engineering situations can be solved with "textbook" data structures, e.g., a doubly linked list, a hash table, or a binary search tree, but many others require some creativity, most often the augmentation of a textbook data structure with fields for storing additional information. We can then implement operations that use the data structure to support the desired application. The process of taking an existing data structure and customizing it to fit our needs has the following main steps: - Choose underlying data structure - Determine the what additional information to store and design the additional fields to be added to the underlying data structure - Show how that additional information can be maintained and how the maintenance affects the existing operations on the underlying data structure (Insertion, Deletion, etc.) - Develop new operations that can be performed on the new data structure Given a binary search tree with n elements and an integer k, design an augmentation strategy whose resulting data structure can support calculating the sum of all the elements less or equal to the kth smallest element in the binary search tree in O(log n Explain in detail your design, how it affects the existing operations on the underlying data structure and how it can support the desired operation in O(logn). (Without the help of an augmented data structure a naive algorithm can provide the desired sum in O(n).) Example: If k=4, the 4th smallest values in the binary search tree in Figure 2 is 54 and the sum of all the numbers in the tree that are less or equal to 54 is 49+51+52+53=205 Figure 2