data structures

We are going to compare the performance between Arrays and Linked Lists.\r\nPlease write C/C++ program following the procedure:\r\n1. Suppose that N is 100 (a number of data).\r\n2. Generate N random numbers between 0 and 100 (can be duplicated)\r\n3. Store the numbers by using both an array and a Linked List.\r\n4. Randomly select one index number between 0 and N-1, and Add a random\r\nnumber to the index of the Array (or Linked List).\r\nFor the array, the following data of the index element should move to the\r\nright.\r\n5. Repeat (4) one hundred times (i.e., add 100 random numbers)\r\n6. Compute the processing time of (4) and (5), and print it.\r\n7. Now, repeat (1) - (6) setting N with 500, 1000, and 2000.\r\nThe C/C++ program should print the progress and processing time (important).\r\nThe output may look like:\r\n-----------------------------------------------------------------------------\r\nN = 100\r\n1) We are generating data (N=100)\r\n2) New data are being added\r\n3) Processing time\r\nArray: 5s\r\nLinked List: 2s\r\n--\r\nN = 500\r\n1) We are generating data (N=100)\r\n2) New data are being added\r\n3) Processing time\r\nArray: 25s\r\nLinked List: 10s\r\n--\r\nN = 1000\r\n1) We are generating data (N=100)\r\n2) New data are being added\r\n3) Processing time\r\nArray: 250s\r\nLinked List: 100s\r\n--\r\nN = 1000\r\n1) We are generating data (N=100)\r\n2) New data are being added\r\n3) Processing time\r\nArray: 2500s\r\nLinked List: 1000s\r\n