Your first task is to write a data type that simulates the operation of a 16 bits Fibonacci LFSR by implementing the following API: To do so, you need to choose the internal representation (data members), implement the constructor, and implement the three member functions. These are interrelated activities and there are several viable approaches. Constructor. The constructor takes the initial seed as a string argument whose characters are a sequence of 0s and 1s. The length of the register is the length of the seed. We will generate each new bit by XORing the leftmost bit and the tap bit, when using resulting bit as one of the inputs for the next XOR gate, and so on. There are 3 tabs for this assignment in positions 13, 12, and 10 (see diagram 2). For example, the following code should create the FibLFSR described above. FibLFSR flfsr("1011011000110110"); Destructor. If your constructor dynamically allocates memory, make sure to define a destructor that deallocates it. String representation. Overload the stream insertion operator to display its