Implement a Queue using a vector or the STD ::queue:: class Note the difference in what it takes to implement using a char[] array vs a vector or the STD ::queue:: class The user will input a string and the program will return the string with each letter in the string duplicated. Displaying correct Queue implementation. Utilize the conventional methods as needed. Sample Execution Please input String: happy Program will produce the output string. Only use the enqueue(), dequeue(), empty(), etc

Put the following code in a main.py file and a module.py file. Define the names sort, list_max and sum_of_list after putting the code into a main file and a module file #predefined modules import random import math #function to sort the list in ascending order def sort(x): #predefined function sort() x.sort() #print the sorted list print("\nSorted list is: ",str(x)) #function to find the sum of list elements def sum_of_list(x): #predefined function sum() Sum=sum(x) #return the sum of list elements return Sum #function to list the maximum from the list def list_max(x): #predefined function max() maximum=max(x) #return maximum return maximum #function to test the above three function def main(): #set a flag variable flag=True #create a list list1=list() #initialize the list element by using randrange() predefined function of random module list1=[random.randrange(1, 50, 1) for i in range(0,7)] #print the...

Help make a C++ program that:1. Queries the user for the name of a file of text.2. Opens the file, and maintains two lists: one list for words beginning with the letter"D" or "d", and a second list for words beginning with any other letter. Each listmust maintain words in alphabetical order.3. Each node in the list must contain the word and the number of times that the word appears.4. Display (a screen at a time) each of the lists showing the alphabetized list of words and thenumber of times that each appears. Please have the main function as the first function in the program. Please make the least amount of functions as possible. Like for the file input have the file error thing in the same function. And please add comments throughout the code.

A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary. ----------------------------------------------------------------------------------- """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst): """Returns the position of the target item if found, or -1 otherwise. The lyst is assumed to be sorted in ascending order.""" position = 0 while position < len(lyst): if target == lyst[position]: return position position += 1 return -1 def main(): """Tests with three lists.""" print(sequentialSearch(3, [0, 1, 2, 3, 4])) print(sequentialSearch(3, [0, 1, 2])) # Should stop at second position. print(sequentialSearch(3, [0, 4, 5, 6])) if...