Objectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab // it represents an array implementation of the stack. // it represents a Linked List implementation of the stack. pointerimofQueue.java // it represents a pointer implementation of the queue. arraylmpofStack.java pointerlmofStack.java Then the students by themselves are required to write the code for the following questions Ex1) Given the file arraylmpofStack.java then write a main method to read a sequence of numbers and using the stack operation print them in reverse order. Ex2) Given the file pointerimofStack.java then write a main method to read a decimal number and print its equivalent binary number. Ex3) Given the file arraylmpOfStack.java then write a main method: - declaring two stack objects S1, S2; - reads a sequence of numbers; store the even ones in the stack S1, and store the odd ones in the stack S2. - print the even numbers followed by odd ones. Ex4) Given the file pointerimofQueue.java then write a main method: to - add some elements into the queue, - reverse the queue contents, (Hint use an array) - print the queue contents. Note that Ex4) can be Solved using a stack instead of the array

Need help with this Java review  If you can also send a screenshot will be helpful to understan   Objective: The purpose of this lab exercise is to create a Singly Linked List data structure . Please note that the underlying implementation should follow with the descriptions listed below.   Instructions : Create the following Linked List Data Structure in your single package and use "for loops" for your repetitive tasks.     Task Check List ONLY "for" loops should be used within the data structure class. Names of identifiers MUST match the names listed in the description below. Deductions otherwise.   Description The internal structure of this Linked List is a singly linked Node data structure and should have at a minimum the following specifications: data fields: The data fields to declare are private  and you will keep track of the size of the list with the variable size and the start of the list with the reference variable data. first is a reference variable for the first Node in…

Can you please help me with this code because i am struggling on how to do this, this code has to be in C code.question that i need help with:Priority with round-robin schedules tasks in order of priority and uses round-robin scheduling for tasks with equal priority. There will be multiple queues in the system each representing one priority class. For ease of implementation, you need total 1 through max_priority numbers of queues. You should start scheduling job out of the max priority queue and serve the members of the queue following RR. The schedule of tasks has the form [task name] [priority] [CPU burst], with the following example format: T1, 4, 20 T2, 2, 25 T3, 3, 25 T4, 3, 15 T5, 10, 10 The output should look like this: Running task = [P1] [4] [5] for 5 units. Task P1 finished. Running task = [P5] [3] [4] for 4 units. Task P5 finished. Running task = [P4] [2] [7] for 1 units. Task P4 exhausted its Quantum hence will be Rescheduled. Running task = [P3] [2] [1] for 1 units. Task…

Please answer the question in the screenshot. The language used is Java.