Given a real number x and given a sequence of real numbers a0, a1, a2, ..., an-1. Give an algorithm to find the value of the n-1 Σ ai xi i=0 Analyze the complexity of your solution. Give a O(n) algorithm.

Computer Algorithms Obtain the complexity of the program fragment below for i <-- 1 to n do k <-- n while K > 1 do K <-- k/2 while (k) end-while end-for

Consider the following recursive algorithm, where // denotes integer division: 3//2 = 1, 5//2 = 2, etc. F(n):if n <= 1: returnF(n//2)for i from 0 to n for j from 0 to n//2 print(i+j) Let function T(n) denote the running time of this algorithm. Derive T(n) and prove its worst case timecomplexity