Write a client function that merges two instances of the Sorted List ADT using the following specification:

Write the prototype for MergeLists.

Write the code for the function.

Describe the algorithm in terms of BigO notation.

Redo your answers to Exercise 6, making MergeLists a member function of the Sorted List ADT.

note : code in c++ with run screen

MergeLists(SortedType list1, SortedType list2, SortedType& result) Function: Merge two sorted lists into a third sorted list. Preconditions: listl and list2 have been initialized and are sorted by key using the function ComparedTo. list1 and list2 do not have any keys in common. Postcon ditions: result is a sorted list that contains all of the items from listl and list2