IN C# create a circularly linked List to support a queue. Write a test program to compare the performance of 4 different data structures we now have (Linked List, Array List, Circular Array from the Lab, and Circular Linked List you just implemented). Load them up with many of your Mobile Objects which you can randomly generate. You will need to use the built in Stopwatch class in C# to compute the time. You should build big enough samples and run enough trials that random variation in the behaviour of your program is not the dominant factor in timings. (Aim for operations that take around 5 seconds total on each structure).

The core operations should let users push or pop (stack) and enqueue or dequeue into each structure. You should also be able to create an empty structure, and delete a structure and all of its contents, as well as print out the entire structure.