Part 1: Bounds-Numbers List case study:

In this assessment you are required to develop a bound-numbers list application in C++. The list must be implemented by linked list. A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below image:

Head A B C D NULL Data Next20 40 30 5 35 29 15 36 30 10 Null Null Null