C2. Short explanation In 3-5 sentences: in your own words, with no traces of Al a) Explain how the LC-3 queue behavior you traced in Part C matches the Java-style queue from Part A.

Part A - Queue as a Java-Style Data Structure (this part is on paper) A1. Consider this queue implementation in Java-like pseudocode: final int CAPACITY = 5; int[] data = new int[CAPACITY]; int head = 0; int tail = 0; int size = 0; // index of the front element // index one past the last element // current number of elements // returns true on success, false if full boolean enqueue(int x) {

Select any text dataset of your own choosing (song lyrics, book excerpt, article, podcast transcript, famous speech, your own writing, etc.). You are to write a program that analyzes the text and produces at least one matplotlib visualization. Requirements: 1. Import text from a .txt file 2. Use string methods to clean and manipulate text (remove punctuation, convert to lowercase, whatever “clean text” means to you) 3. Build dictionaries to count at least 2 things (these are only suggestions): a. Word frequency b. Letter frequency c. Sentence length distribution 4. Use lists to store and process data 5. Include at least 2 functions: a. One void function (e.g., display results) b. One return-value function (e.g., returns a dictionary of word counts) 6. Produce one or more matplotlib graphs: a. Bar chart of top 10 words b. Pie chart of letter usage c. Line graph of sentence lengths Be sure your program is created in the correct format, so the graph is displayed in our online IDE. Failure…