the programming language should be in C++ form.

An ordered list is a sequence of elements, all of the same type, that is ordered by the elements' values. For example, is an ordered list of integers. Clearly, many kinds of data might be organized into ordered lists, and we would like to manipulate such structures in programs. In this project, you will use a class to implement an ordered list type. You are to design and write a class that implements an ordered list type, and a program that exercises and tests the class's list implementation. The elements of the class's lists will be integers, but it should be easy to change this type. The class should implement the following operations on ordered lists of its element type: Initialize a list to be empty (the default constructor). Re-initialize an existing list to be empty. Insert a value into a list, in the appropriate position. If the value is already present, the list is unchanged. Remove a value from a list. If the value is not present, the list is unchanged Return the length of a list. Report whether or not a particular value is present in a list. Return the value of the k^th element of a list. Merge two lists into a third: the third list contains all the values found in the first two lists, in order, with no values duplicated. Write out the values in a list, in order, to an output stream. The exercising program should be menu-driven and interactive, as in the Bag program example. The program will read and respond to commands that the user enters, and it should manipulate an array of at least three lists of integers