Using C++ please

This assignment must use Doubly-Linked List with Head Node Specifications: Develop a Doubly-Linked List class based on the following ADT Name: DL List Data Members Node * bead.node//a pointer pointing to the first node, e.g., the head node Member Functions constructor bool empty() //check whether the list 1s empty void insert succ(Node *new, Node *succ) //insert a new node before the successor void erase node(Node *node) //delete the node from the list int erase.by data(int d) // delete all the node(s) that has the data specified, return the number of nodes that have been deleted void displayO/ display all items on the list, from the beginning to the end; moreover, display the size of the list double calc.mean0 // calculate and return the mean of all nodes' data on the list double cals SD(double mean) // calculate and return the standard deviation of all nodes The data stored in a Node object is a score between 30 and 100, generated randomly. DO NOT use the time function, so that the random numbers generated are always follow the same sequence The driver must conduct the following tasks in the order specified below: 1. Instantiate 50 Node's objects, where the scores are generated randomly (must use a loop) 2. Instantiate a PLList object, named mylist 3. Insert all nodes. 4. Display all nodes and the size of the list 5. Calculate and display the mean and the SD 6. Delete the first node Display all nodes and the size of the list Calculate and display the mean and the SD 7. 8. 9. 10. Display the all nodes and the size of the list Erase all the nodes that have the same value as the data specified (pick a number that exists, pick one that appears more than once) 11. Calculate and display the mean and the SD