C++ data structures

Lab Exercises Using this information for your class definition: #pragma once #include class Sequence public: // TYPEDEFS and MEMBER CONSTANTS Lypeder ------ value_type; typedef std::size_t size_type; static const size type CAPACITY - 30; // CONSTRUCTOR Sequence: // MODIFICATION MEMBER FUNCTIONS void starto: void advance; void insert(const value_type& entry); void attach(const value_type& entry); void remove_currento; 1/ CONSTANT MEMBER FUNCTIONS size_type size const; bool is_item const; value_type current const; privale: value_type data[CAPACITY]; size type used; size_type current_index; Implement the Sequence class. Then, test the Sequence class by using the insert() function, and then using a for loop (in the main function) with start(), is_item(), advancel) and current(). Then, you can call advance() after for loop, and use insert() to insert a value in the sequence. Do this as well for attach(), and finally with remove(). Lab Exercises Using this information for your class definition: #pragma once #include class Sequence public: // TYPEDEFS and MEMBER CONSTANTS Lypeder ------ value_type; typedef std::size_t size_type; static const size type CAPACITY - 30; // CONSTRUCTOR Sequence: // MODIFICATION MEMBER FUNCTIONS void starto: void advance; void insert(const value_type& entry); void attach(const value_type& entry); void remove_currento; 1/ CONSTANT MEMBER FUNCTIONS size_type size const; bool is_item const; value_type current const; privale: value_type data[CAPACITY]; size type used; size_type current_index; Implement the Sequence class. Then, test the Sequence class by using the insert() function, and then using a for loop (in the main function) with start(), is_item(), advancel) and current(). Then, you can call advance() after for loop, and use insert() to insert a value in the sequence. Do this as well for attach(), and finally with remove()