For this assignment, you must implement the Data Encryption Standard (DES) algorithm with any programming language that you are comfortable with. The recommendation is to use C/C++ or Java. You can accomplish this assignment individually or by forming a team of 2 students. You can utilize the publically available tables/functions in order to implement the DES. You can find these permutation tables/functions in some reference books or over the Internet. You algorithm should get a plaintext as well as a "secret key" from the user and then perform encryption (generating the ciphertext from the plaintext) and decryption (generating the original plaintext from the ciphertext). You can also select any "mode of operations that you want. All the necessary technical materials are available in the posted lectures on Canvas. You must submit all related files in a zip file on Canvas (just one file for each group, submitted by the group leader). Make sure to include a "ReadMe.txt" file so that I know what you have done and how your program can be executed.

Write a c++ program to simulate a coffee shop or a Mcdonald's drive-thru where different customers give an order and they receive a unique ID then you use Queue Data Structure to arrange the order and use a sorting algorithm to sort identical orders so that you can make your entire servicing faster at the end the customer is given a receipt with his order, price, and ID on it. Make sure to use classes.

Write the python3 code for the given problem....    Please write C++ code also....     It's urgent!!!!!!!!!!

When an author produces an index for his or her book, the first step in this process is to decide which words should go into the index; the second is to produce a list of the pages where each word occurs. Instead of trying to choose words out of our heads, we decided to let the computer produce a list of all the unique words used in the manuscript and their frequency of occurrence. We could then go over the list and choose which words to put into the index. The main object in this problem is a "word" with associated frequency. The tentative definition of "word" here is a string of alphanumeric characters between markers where markers are white space and all punctuation marks; anything non-alphanumeric stops the reading. If we skip all un-allowed characters before getting the string, we should have exactly what we want. Ignoring words of fewer than three letters will remove from consideration such as "a", "is", "to", "do", and "by" that do not belong in an index. In this project, you…