please code in python def duplicate(nums,a):     """     MODIFIES thelist so that all occurrences of a are duplicated          This function should have NO RETURN STATEMENT          Examples: If a = [1,2,3,1] then a becomes [1,1,2,3,1,1] after duplicate(a,1).               If a = [1,2,3,1] then a remains [1,2,3,1] after duplicate(a,4).              Parameter nums: list to modify     Precondition: nums is a list of ints          Parameter a: value to search for     Precondition: a is an int     """     # IMPLEMENT A WHILE LOOP HERE          # END WHILE LOOP          pass

Use stack concepts Q #2 Ô https://www.loc-cs.org/~chu/DataStructu Essay Questions (20% each)- continue [0] [1] [2] [3] myList "Bashful" "Awful" Jumpy "Happy The above "myList" is an ArrayList in Java program. 2. If I want to remove "Awful" from myList, which of the following actions should I take first? a. Move "Happy" to the previous element first. b. Move "Jumpy" to the previous element first. Describe the reason of your choice. Next Page

JAVA programming language

C++ The binary search algorithm given in this chapter is nonrecursive. Write and implement a recursive version of the binary search algorithm. The program should prompt Y / y to continue searching and N / n to discontinue. If an item is found in the list display the following message: x found at position y else: x is not in the list Use the following list of integers when testing your program: 2, 6, 8, 13, 25, 33, 39, 42, 53, 58, 61, 68, 71, 84, 97

Python question Analysis: Invariants (Q16-17) For each of the following functions, identify the loop invariant, exit condition and post condition.    Question 16 (Invariant 1) This function returns the list of integers that are multiples of both 3 and 7 that occurs within a given list. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of the loop, which shows the algorithm’s correctness. def multiples_count(lst):    """    Input: a list of integers, lst    Output: the list of integers in lst that are multiples of both 3 and 7    """    res = []    for i in range(len(lst)):        if lst[i]%3 == 0 and lst[i]%7 == 0:            res.append(lst[i])        # Identify the loop invariant here    return res Question 17 (Invariant 2) This function checks if a given list (of comparable elements) is sorted in ascending order. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of each iteration of the loop, which…

Python Big-O Notation/Time Complexity Pls answer only if u know big-o Thanks!  Item #3.

def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. '''     pass

#include <stdio.h>#include <limits.h>  int findMissingUtil(int arr[], int low, int high, int diff){  if (high <= low)return INT_MAX;    int mid = low + (high - low)/2;    if (arr[mid+1] - arr[mid] != diff)return (arr[mid] + diff);  if (mid > 0 && arr[mid] - arr[mid-1] != diff)return (arr[mid-1] + diff);    if (arr[mid] == arr[0] + mid*diff)return findMissingUtil(arr, mid+1, high, diff);  return findMissingUtil(arr, low, mid-1, diff);}   int findMissing(int arr[], int n){int diff = (arr[n-1] - arr[0])/n;    return findMissingUtil(arr, 0, n-1,diff);}   int main(){int arr[] = {120001, 120013, 120025, 120037, 120049, 120061,120085,120097,120109,120121};int n = sizeof(arr)/sizeof(arr[0]);printf("The missing element is %d", findMissing(arr, n));return 0;} ______________________________________________________________________________ Convert the code above into Pseudocode

language = python