Programming language is C++

Consider the ADT "Sorted List" Class SortedList Public SortedType0 int getLenth0 void putltem(Itemtype item); inserts an item Itemtype getNextltemO; void deleteltem(Itemtype item Ideletes a specified item /returns size of the list //returns the next item pointed by the index private int length; Nodetype* listData Nodetype* currentPos; //length of the list //head of the list //current pointer to the list Class Itemtype Public Itemtype0 int getValue0://returns the value Private int value struct Nodetype Itemtype info; Nodetype* next; 02. Add another function "MaximumValue" that will return the max value in the list.Analyze its time complexity in terms of n which is the number of elements in the list Note: No need to write whole list program. Just function definition is enough