There are several episodes for a web series. The details of each episode are stored as a node in a linked list. The data of each node contains serial id, episode number, array of customer numbers. Create a linked list for your favourite web series and add 8 episodes to it. Next, modify the list from some position, n, such that the episode at position n is the first node of the linked list. For this, write two functions: a. Rotate the list from n, in the clockwise direction b. Rotate the list from n, in the anti-clockwise direction

nclude <iostream>
#include <list>
using namespace std;

struct node
{
    int serial;
    node *next;
};

class list
{
public:
    list();
    ~list();
    void add(int);
    void display();
    void delete(int);
    void delete_all();
    void search(int);
    void search_all