I need help with this in c programming This question is about practicing with Data Structures. You will be provided with partially complete data structure problems. Your goal is to finish the implemenations. All code you will write is in one file (queue.c). You are provided with a header and main file. You will create queue.c on your own. Part 1: Queues Data Structure (50 points) The goal of this assignment is to implement and use a queue. You will implement the queue using the framework provided. This is a specialized version of a linked list. You are provided with two files. You will create the third file. main.c - A collection of tests for your queue. DO NOT CHANGE THIS FILE queue.h - Prototypes and Data Structures needed for the assignment. DO NOT CHANGE THIS FILE queue.c - CREATE this file. Then implement all the functions described in queue.h. Note You can just have josephus return NULL to implement and test this part. The implementation is described in the next section. You can test the queue you are implementing using main.c. Once it is completely implemented, you should pass all the tests in main.c. See code for more details. We advise you look through main.c to see what the tests do. The following are the expected tests and outputs of the code.

This question is about practicing with Data Structures. You will be provided with partially complete data structure problems. Your goal is to finish the implemenations. All code you will write is in one file (queue.c). You are provided with a header and main file. You will create queue.c on your own. Part 1: Queues Data Structure (50 points) The goal of this assignment is to implement and use a queue. You will implement the queue using the framework provided. This is a specialized version of a linked list. You are provided with two files. You will create the third file. 1. main.c - A collection of tests for your queue. DO NOT CHANGE THIS FILE 2. queue.h - Prototypes and Data Structures needed for the assignment. DO NOT CHANGE THIS FILE 3. queue.c - CREATE this file. Then implement all the functions described in queue.h. Note You can just have josephus return NULL to implement and test this part. The implementation is described in the next section. The following are the expected tests and outputs of the code. Test 01 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 1 newQueue: PASSED Test 02 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 2 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 3 front: PASSED Test 04 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 4 isEmpty: PASSED Test 05 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 5 dequeue: PASSED Test 06 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 6 Random Values: PASSED Test 00 Test 00 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 0 Running ALL Tests newQueue: PASSED enqueue: PASSED front: PASSED isEmpty: PASSED dequeue: PASSED Random Values: PASSED