I have attached the header file and the main file. I need an implementation file with the following in C++:

Complete the sequenceFixed class implemantation file to include the following class methods:

- attach member function to insert item in sequence after current item.

- remove_current member function to remove current item.

- erase_one member function to remove first occurrence of given item. Return true if found and removed, false otherwise.

Use teh following to ensure class invariants remain valid:

// bool erase_one (const value_type& entry)

// Precondition: size() > 0

// Postcondition: if entry was in the sequenceFixed,

// then one copy has been removed; otherwise the

// sequenceFixed is unchanged. A true return value

// indicates that the first copy was removed;

// false indicates that nothing was removed.

// Current item is set to first item in sequenceFixed.

Use the sequenceFixed_exam.cpp program to test the implementaion of the class and determine potential points.

Header File #include cstdlib> class sequenceFixed public // aliases for 'dynamic' data types using value type double; using size type std:size t; // maximum size of container ic const size type CAPACITY- 30; // default constructor sequenceFixedO; // constant member function size _type size) const; bool is_item0 const; value type currentO const; functions to position current_index void startO void advance // function to modify stored data void insert(const value type&); void attach(const value type&); void remove current); bool erase one(const value type&) private: data[0; to data[used-l] stored referance value type data[CAPACITY];/ relevant items stored in size type used; size type current index;current item's index // number of items