Write a C++ program that implements a linked list as an abstract data type. The program must: Be type flexible, that is, could be a list of integers, string, or any type. allow the user to add members into the list delete members from the list make sure the list is still sorted after all the deletion and addition Show all the function implementation.

1. fast please in c++

use replit please Thank you

Please just use main.cpp,sequence.cpp and sequence.h. It has provided the sample insert()function.   No documentation (commenting) is required for this assignment. This assignment is based on an assignment from "Data Structures and Other Objects Using C++" by Michael Main and Walter Savitch. Use linked lists to implement a Sequence class that stores int values. Specification The specification of the class is below. There are 9 member functions (not counting the big 3) and 2 types to define. The idea behind this class is that there will be an internal iterator, i.e., an iterator that the client cannot access, but that the class itself manages. For example, if we have a Sequence object named s, we would use s.start() to set the iterator to the beginning of the list, and s.advance() to move the iterator to the next node in the list. (I'm making the analogy to iterators as a way to help you understand the point of what we are doing. If trying to think in terms of iterators is confusing,…