Consider the following algorithm: Input: Array A and B both with n integers. Output: Array C with n integers such that C[j] is the maximum of A[j] and B[j] for all 1< j< n. Swap (A, B) 1. C is a new array with n integers with value 0. 2. C[1] = max{A[1], B[1]} 3. for i = 2 to n %3D 4. if A[i] > B[i] then Ci] = A[i] else C[i] = B[i] 7. return A 5. 6. a Prove a tight upper bound on the running time of Swap in terms of O.

The algorithm below searches for the maximum in an input array A. Assume A is a random sequence containing n distinguishable real numbers, what is the probability for line #4 to be executed exactly once? (The phrase "random sequence" here means the n numbers can appear in any order with equal chance.) mymax(A, n) { 1: max = A[1]; 2: for i = 2:n 3: if A[i] > max 4: max = A[i); 5: end; 6: end; 7: return max; }

A majority element is an element that makes up more than half of the items inan array. Given a positive integers array, find the majority element. If there is no majority element,return -1. Do this in O(N) time and 0(1) space.Input: 1 2 5 9 5 9 5 5 5Output: 5

15. Consider the problem of finding the first position in which an array b occurs as a subsequence of an array a. Write two nested loops: let result undefined for (let i = 0; i < a.length - b.length; i++) { for (let j = 0; j < b.length; j++) { if (a[i+j] = b[j]) . . . } } Complete with labeled break and continue statements.

you are given integers A = [a0, a1, a2, · · · an], where a are integers. We want to determine the largest sum of a portion of consecutive values in the array.  array A = [3, 13, −20, 9, −3, 30, 9, −70], largest sum of a portion of consecutive values is 9-3+30+9 = 45. a) you must write an iterative algorithm that can determine the largest sum of a portion of consecutive values / show the time complexity  b)Write a dynamic programming-based algorithm that determines the largest sum of a portion of consecutive values/show its time complexity

do not plagiarise