Problem: List Reverse Given a list (objects with a chain of sub-objects, for example: var list = { value: "dog", next: { value: "cat", next: { value: "bird", next: null Reverse the order of the list so that it looks like: var list = { value: "bird", next: { value: "cat", next: { value: "dog", next: null Use the following shell if needed: function reverselist(list) { // your code here return reversedList; Example Test Case(s): Arguments: { value: 1, next: { value: 2, next: { value: 3, next: null }}}; Returns: { value: 3, next: { value: 2, next: { value: 1, next: null } Í ; Requirements: • You cannot use the built-in reverse) function. • null is non-existent object, you may use an empty object instead if desired. Your function should be able to reverse a list of values of strings or numbers.

The program requires me to remove all item for a list, but when doing the test case for it, it only removes one. What would be the problem in this code?Given code: #include "MovieList.h"#include <iostream> using namespace std;// Constructor functionMovieList::MovieList() {     top = nullptr; } // Destructor functionMovieList::~MovieList() {     MovieNode *p = nullptr;     while (top->next != nullptr) {        p = top;        top = top->next;        delete p;    }     delete top;    p = nullptr;    top = nullptr; } void MovieList::display(ostream &out) {     MovieNode *t = top;    int pos = 0;    // Function to display the movie list    while (t != nullptr) {        out << pos << ": " << t->title << endl;        pos++;        t = t->next;    } } int MovieList::count() {     MovieNode *t = top;    int pos = 0;    // Counting based off the movie list    while (t != nullptr) {        pos++;        t = t->next;    }    return pos; } void…

Write a python hangman program Modify your program so that the following functionality is added:1. Instead of selecting the word from a hard coded list, incorporate problem2 so that thelist is read from a file, then a word is randomly selected from this list.2. when the game ends, the following information should be outputted to a new file:● the word● the state of the hangman● if the user won or lostExample outputs:quokkaO\||You won!kangarooO\|/|/ \You lost

en "MyDoubleLinkedList" class: te a method called "PrintListInReverse" to print the list backward. example, Given

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

starter code //Provided imports, feel free to use these if neededimport java.util.Collections;import java.util.ArrayList; /** * TODO: add class header */public class Sorts {    /**     * this helper finds the appropriate number of buckets you should allocate     * based on the range of the values in the input list     * @param list the input list to bucket sort     * @return number of buckets     */    private static int assignNumBuckets(ArrayList<Integer> list) {        Integer max = Collections.max(list);        Integer min = Collections.min(list);        return (int) Math.sqrt(max - min) + 1;    }     /**     * this helper finds the appropriate bucket index that a data should be     * placed in     * @param data a particular data from the input list if you are using     *             loop iteration     * @param numBuckets number of buckets     * @param listMin the smallest element of the input list     * @return the index of the bucket for which the particular data should…

let buckets (f:'a->'a->bool) (lst:'a list): 'a list list =  let rec find (find_f: 'a->'a->bool)(find_ht: 'a) (find_acc:'a list list):'a list list =     match find_acc with      []-> [[find_ht]]    | head::tail -> match head with h::_-> if f h find_ht then (find_ht::head)::tail else head::(find f find_ht tail)  in  let rec parse (parse_f: 'a->'a->bool) (parse_lst:'a list) (parse_acc: 'a list list): 'a list list =     match parse_lst with      [] -> parse_acc    | ht::tl -> parse f tl (find f ht parse_acc)   in   match lst with     []->[]  | ht::tl -> parse f tl [[ht]];; let buckets (f:'a->'a->bool) (lst:'a list): 'a list list =  let rec find (find_f: 'a->'a->bool)(find_ht: 'a) (find_acc:'a list list):'a list list =     match find_acc with      []-> [[find_ht]]    | head::tail -> match head with h::_-> if f h find_ht then (find_ht::head)::tail else head::(find f find_ht tail)  in  let rec parse (parse_f: 'a->'a->bool)…

Pythong help!

A-1: Let l = [−1, −2, . . . , −10] be an existing list. Construct a new list from l by dividing each evennumber element in l by 2. Print the new list. Do not use NUMPY library.A-2: Create a new list containing the following elements using list comprehension:[1, −1, 2, −2, 3, −3, ..., 9, −9]A-3: Consider the following coded string. Create a list of all contiguous (connected without space) lettersin the order of their appearance."Vjg dguv rtqitcou ctg ytkvvgp uq vjcv eqorwvkpi ocejkpgu ecp rgthqto vjgoswkemn{0 Cnuq. vjg dguv rtqitcou ctg ytkvvgp uq vjcv jwocp dgkpiu ecp wpfgtuvcpfvjgo engctn{0 C iqqf guuc{kuv cpf c iqqf rtqitcoogt jcxg c nqv kp eqooqp0"A-4: In the list obtained after executing task(s) from Part(A-3), remove newline characters (if any).A-5: For the list obtained after executing task(s) from Part(A-4), for each word in the list do thefollowing:ˆ Breakdown the word into list of letters.ˆ Convert each of the above letters into integer, using ord() function.ˆ Update the…

PYTHON LAB: Inserting an integer in descending order (doubly-linked list) Given main.py and an IntNode class, complete the IntList class (a linked list of IntNodes) by writing the insert_in_descending_order() method to insert new IntNodes into the IntList in descending order. Ex. If the input is: 3 4 2 5 1 6 7 9 8 the output is: 9 8 7 6 5 4 3 2 1   _____________________________________________________________________________________   Main.py: from IntNode import IntNode from IntList import IntList   if __name__ == "__main__":     int_list = IntList()         input_line = input()     input_strings = input_line.split(' ')         for num_string in input_strings:         # Convert from string to integer         num = int(num_string)           # Insert into linked list in descending order         new_node = IntNode(num)         int_list.insert_in_descending_order(new_node)             int_list.print_int_list() IntNode.py class IntNode:     def __init__(self, initial_data, next = None,…