REQUIREMENTS: 1. Using Python, you will write a program called singly-linked-list-arrays.py that implements an ordered singly-linked list using arrays. 2. The data items in your ordered singly-linked list will consist of first names. For example: Adam, Eve, Frank, Mark, Vanessa, etc. 3. Be sure to include the following linked list operations in your Python program: GetNode(FreeNodes) returns the index of the first available (free) node as indicated in the FreeNodes boolean array. If there are no available (free) nodes, then 4 returns-1. • InsertNode(Data, Link, FreeNodes, new Node, headPtr) inserts a newNode into the linked list, referenced by headPtr, as represented using the Data and Link arrays. The index of the corresponding FreeNode array element is assigned the value of False, indicating that this node is no longer considered "free." Returns +1 if successfully inserted into the list, otherwise returns -1. ▪ DeleteNode(Data, Link, FreeNodes, node ToDelete, headPtr) deletes the node ToDelete from the linked list, referenced by headPtr, as represented using the Data and Link arrays. The index of the corresponding FreeNode array element is assigned the value of True, indicating that this node is now considered "free." Returns +1 if successfully deleted, otherwise returns -1. ▪ SearchList(Data, Link, FreeNodes, findNode, headPtr) searches the linked list, referenced by headPtr and represented using the Data and Link arrays, for which the data value matches that of findNode. Returns the index value in the Data array of the found node. If the findNode item is not found, then the value -1 is returned. PrintLinked List (Data, Link, headPtr) prints the data values of all nodes in the singly-linked list, in order. If the linked list is empty, then prints "No items in the linked list."

Write a python program that takes two lists, merges thetwo lists, sorts the resulting list, and then finds the median of theelements in the two lists. You cannot use python build-in sort() function #todo#You can use math functions like math.floor to help the calculationimport math #todo#You can use math functions like math.floor to help the calculation import math def task7(list_in_1, list_in_2):  # YOUR CODE HERE                return median please use these variables no print function please

-python- Write a function called get_words that takes a list of words and a letter,and returns a new list, which only contains the words that don't have the given letter in them. For example, get_words(["cat", "dog"], 'o') should return ["cat"] and get_words(["cat", "bat"], 'a') should return an empty list.

PYTHON!!! Write a function that will filter course grades that are stored in a list, creating and returning a new list. Your implementation must have the following rules: - The function must accept two (and only two) parameters: The first is: the maximum integer value for any grade to remain in the list (any value above the maximum will be filtered and removed from the list). The second is: the list of grades (you can assume the list contains only integer values) - The function must return a new list and not modify the existing list. - The function must use a list comprehension to filter the existing list and create the new list that is returned. - DO NOT USE THE: built-in-"filter" function.

Lin in out 1283.

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.