a code for list c

nums = [9,-8,7,-6,3,2,-1,3,10,9] Use enumerate to iterate through the index and values of the nums list, and output the index where userNum is found. For example, if userNum is 3, your output should be: Number 3 found at index 4 Number 3 found at index 7

scheme:  Q9: Sub All Write sub-all, which takes a list s, a list of old words, and a list of new words; the last two lists must be the same length. It returns a list with the elements of s, but with each word that occurs in the second argument replaced by the corresponding word of the third argument. You may use substitute in your solution. Assume that olds and news have no elements in common. (define (sub-all s olds news)    'YOUR-CODE-HERE   )

Write the following function that returns true if the list is already sorted in increasing order:def isSorted(lst):Write a test program that prompts the user to enter a list and displays whether the list is sorted or not.

Help please in C++ language Sort 231 123 324 100 230 560 using Radix Sort. Hint: Use "0-list", "1-list", etc. named after the "char" you are looking for. Pass 1 Show the sub-lists here based on the last character, Show the combined list. Pass 2 Show the sub-lists here based on the second character, Show the combined list. Pass 3 Show the sub-lists here based on the first character, Show the combined list.

OCaml Code: Please read the attached instructions carefully and show the correct code with the screenshot of the output. I really need help with this assignment.

Quick Answer please

JS Write a function named find_value that takes a list/array of whole numbers as a parameter. Your functio will need to find if the parameter contains the value 3 as an entry. Return true if the input has an entry equivalent to 3 and false if it does not.

Python

Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. Below are the "CODE THAT NEEDS TO BE IMPROVED" or "NOT FINAL CODE"  (See attached photo for reference)  int add(int num) This will add the element num into the linked list and return the position of the newly-added element. In the above example, having add(60) will return 5 as it is the fifth position in the list. int remove(int num) This will remove the first instance of the element and return the position of the removed element. In the above example, having remove(40) will return 3 as 40 was the third element in the linked list before having removed. int get(int pos) This method will get the element at the specified position. This will return -1 if the specified position is invalid.   int add(int num) {             addTail(num);             return index;         }           int remove(int num) {             node* currnode = head;             node* prevnode = NULL;…