Help needed for a C++ Project

ADT MultiMap – implementation on a singly linked list on an array Your task is to: o Implement and test the given ADT (all operations from the ADT, even if they will not be used later). o Find a problem that can be solved with the given ADT. o Implement the solution of the problem using the implemented ADT.  There are projects where the problem is given as well, for those projects a solution to the given problem has to be implemented.  Realization of a project consists of the implementation of an application and a documentation (on paper). o The application:  has to be implemented in C++, and it does not have to be generic (you can implement the ADT directly with the elements that will be stored in it for solving the problem). If the application is not working, the project grade will be 4.  every operation from the interface of the ADT has to be tested. Write tests to achieve at least 95% coverage for all the operations from the container (try to use some tool that shows the coverage of the tests, for example: OpenCPPCoverage).  no containers or data structures implemented in different libraries can be used. o The documentation has to contain the following elements:  ADT – domain and interface (independent of the representation). If the container can be iterated, than the interface of the iterator has to be written as well.  Representation of the container and implementation of the operations in PSEUDOCODE (iterator as well).  Tests for the container (can be C++ copied from editor).  Complexity of the operations from the interface, for one operation (that does not have constant complexity) the computations done for determining the complexity (worst, average...).  The statement of the problem chosen to be solved using the given ADT. Describe why the given ADT is suitable for solving the selected problem.  The solution for the proposed problem: PSEUDOCODE for every function from the solution.  Complexity of the operations from the solution.