Q/By using nested loops, generate a 6-by-7 matrix R = [rmn), where rmn In(m) / cos(m³-1+log(n))

To compute the average of the squares of the elements of a vector V, aka the mean square, we (Note: use randn to create a random vector) Select one: a. We use polyfit which does least squares and skip the minimization part   b.we use sum(V.^2)./length(V*V)   c.we use sum(V.*V)/length(V)   d.we use mean(V)   e.we use sum(V^2)/length(V)

We are given a code symmetry, that takes an n x n matrix as its argument. It returns true if the matrix is symmetric and false if it is not. The run time of the code is calculated by counting how many times the /= comparison is executed.  procedure symmetry(M)      for x:=1 to (n-1)            for y:=(i+1) to n               if mxy /= myx then return false               else return true (a) Calculate the best case run time for symmetry (will be a number). (b) Calculate the worst case run time for symmetry (will be a polynomial in n, it will be helpful to draw matrices of different sizes and compare the number of comparisons to find a pattern).  (c) Determine the worst case run time in big O notation (d) Using the following definition of big O notation, prove the answer to (c) Definition: Let f and g be functions from the set of integers or the set of real numbers to the set of real numbers. We say that f(x) is O(g(x)) if there are constants C and k such that whenever x > k. [This is…

Given an array arr[] of N non-negative integers representing the height of blocks. If width of each block is 1, compute how much water can be trapped between the blocks during the rainy season. Example 1: Input: N = 6 arr[] Output: 10 = {3,0,0,2,0,4}