In JavaScript use recursion to find the sum of all pages in the following: function getPageTotal(list) { // your code here // returns an integer } Example test case: Input: { "book":"A", "pages":50, "next":{ "book":"B", "pages":25, "next": null } } Output: 75 Reasoning: 50 + 25 pages

Write a recursive function that returns the largest integer in a list. Write a test program that prompts the user to enter a list of integers and displays the largest element.

Write code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".

Implement a function void printAll(void) to print all the items of the list.

Write code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".

Question in image Please explain the algorithm with the answer. Python programming

Java - This project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select. You will implement the following: Bubble Sort (pair-wise) Bubble Sort (list-wise) [This is the selection sort] Merge Sort Your choice (candidates are the heap, quick, shell, cocktail, bucket, or radix sorts) [These will require independent research) General rules: Structures can be static or dynamic You are not allowed to use built in methods that are direct or indirect requirements for this project – You cannot use ANY built in sorting functions - I/O (System.in/out *) are ok. All compare/swap/move methods must be your own. (You can use string compares) Your program will be sorting names – you need at least 100 unique names (you can use the 50 given in project #3) – read them into the program in a random fashion (i.e. not in any kind of alpha order). *The more names you have, the easier it is to see trends in speed. All sorts will be from...

Complete the recursive function remove_last which creates a new list identical to the input list s but with the last element in the sequence that is equal to x removed. Hint: Remember that you can use negative indexing on lists! For example 1st [-1] refers to the last element in a list 1st, lst [-2] refers to the second to last element... def remove_last(x, s): """Create a new list that is identical to s but with the last element from the list that is equal to x removed.>>> remove_last(1, []) []>>> remove_last(1, [1]) []>>> [1]>>> [2] remove_last(1, [1,1]) remove_last(1, [2,1])>>> remove_last(1, [3,1,2]) [3, 2]>>> remove_last(1, [3,1,2,1]) [3, 1, 2]>>> remove_last (5, [3, 5, 2, 5, 11]) [3, 5, 2, 11] IIIII "*** YOUR CODE HERE ***" Illustrated here is a more complete doctest that shows good testing methodology. It is a little cumbersome as documentation, but you'll want to think about it for your projects. Test every condition that might come up. Then you won't be surprised when...

IN PYTHON THANK YOU

Python

In C++ I need to write a recursive function insertEnd that will call a recursive method insertEnd(const ItemType& newEntry, Node<ItemType>* node), to insert newEntry at the end of the linked list I completely stuck and can't figure out where the error is coming from. main #include <iostream> #include "LinkedList.cpp" int main() { Node<int>* first = new Node(1); Node<int>* second = new Node(2); Node<int>* third = new Node(3); first->next = second; second->next = third; cout<<first->data<<endl; cout<<first->next->data<<endl; cout<<first->next->next->data<<endl; LinkedList<int> list; //an empty linked list for(int i =0; i<10; i++){ list.inserEnd(i); list.display(); } return 0; } linkedlist.cpp #include "LinkedList.h" #include "iostream" using namespace std; template <class T> LinkedList<T>::LinkedList(){ head = nullptr; } template <class...