IN C Your assignment is to implement these two types of list data structures and to compare their performance (execution time) using the following workloads: 1) Starting with an empty list, two...

I need the answer as soon as possible

Extracted text: IN C Your assignment is to implement these two types of list data structures and to compare their performance (execution time) using the following workloads: 1) Starting with an empty list, two threads running at the same time insert 1 million random integers each on the same list. 2) Starting with an empty list, one thread inserts 1 million random integers, while another thread looks up 1 million random integers at the same time. 3) Starting with a list containing 1 million random integers, two threads running at the same time look up 1 million random integers each.