(Solved): What to do? Implement 2 types of design for Queue data structure using Array: 1. Fixed front 2. Flo ...

What to do? Implement 2 types of design for Queue data structure using Array: 1. Fixed front 2. Floating front Do the following operations on Queue: 1. Enqueue employee objects 2. Dequeue employee object Employee objects can be obtained by reading the "emp.txt" file. Make sure that your code is well documented i.e., in-line comments. For instance, every function and complex portion of code should have comments that describe what it does. Program input A single .txt file named "data.txt". Program output For each queue types, fixed front and floating front: 1. Print elements stored in queue. 2. Dequeue twice 3. Print elements stored in queue once again. What to turn in? 1. Pseudocode file (must include all class files including application with main method) 2. Source code and data.txt file 3. Java Bytecode files (*. class) to run without compiling. 4. The source code must not include any package. 5. Your program's output screenshots in a PDF file. 6. README file to demonstrate how your program works (or not working).