Write a complete C++ program for practicing linked lists to display a linked list with the values (0-1-2-3), insert a node which has a value (4) at the end of the linked list and delete the last node of the linked list (4)

Write a complete C++ program for practicing linked lists to display a linked list with the values (0-1-2-3), insert a node which has a value (4) at the end of the linked list and  delete the last node of the linked list (4)

The program contains:

- A complete struct Node.

- Display() function.

- Insertlast() function.

- Removelast() function.

- Any other related methods.