small project in java

• multiEnqueue(Type els[], int k, int l): requires: None. input: Type els[], int k. results: The first k elements of the array els are added to the queue at its tail one at a time until the queue is full or all k elements are added. The output l is set to the number of elements that have been added. output: l. • multiServe(Type els[], int k, int l): requires: None. input: Type els[], int k. results: The first k elements of the queue are served and stored in els starting at position 0 until the queue is empty or all k elements are served. The output l is set to the number of elements that have been served. output: l. ------------------------------- • multiPush(Type els[], int k, int l): requires: None. input: Type els[], int k. results: The first k elements of the array els are pushed to the stack one at a time until the stack is full or all k elements are added. The output l is set to the number of elements that have been pushed. output: l. • multiPop(Type els[], int k, int l): requires: None. input: Type els[], int k. results: The top k elements of the stack are popped and stored in els starting at position 0 until the stack is empty or all k elements are popped. The output l is set to the number of elements that have been popped. output: l. --------------------------- Write a class called SimpleEncrypt. In this class, you should implement the following static methods: (a) public static Stack<Queue<Character>> readSentences(String fileName): A method that reads sentences from a text file fileName separated by new line and builds a stack of queues, where each sentence is represented by one Queue of characters. The first sentence in the file must be at the top of the stack. The method must catch any exceptions and return null if any. Sample input: ABCDEFGHIJKLMN I love CSC212 The fat cat sat on the mat curiosity killed the cat (b) public static void encrypt(Queue<Character> q, int k): A method that reverses each block of k characters in the sentence represented by q. Assume k ≥ 1. Example 1. Here are two examples: • If q = ABCDEFGHIJKLMN, then by calling encrypt(q, 4), we obtain: DCBAHGFELKJINM. • If q = I love CSC212, then by calling encrypt(q, 4), we obtain: ol IC ev12CS2. Hint: use the new methods added to Queue and Stack. (c) public static void decrypt(Queue<Character> q, int k): A method that decrypts (removes the encryption) the sentence represented by q. Assume k ≥ 1. Example 2. Here are two examples: • If q = DCBAHGFELKJINM, then by calling decrypt(q, 4), we obtain: ABCDEFGHIJKLMN. • If q = ol IC ev12CS2, then by calling decrypt(q, 4), we obtain: I love CSC212. (d) public static void encrypt(Stack<Queue<Character>> st, int k): A method that encrypts all sentences in the stack st. The order of the sentences within the stack must not change. Assume k ≥ 1. (e) public static void decrypt(Stack<Queue<Character>> st, int k): A method that decrypts all sentences in the stack st. The order of the sentences within the stack must not change. Assume k ≥ 1.