t: 4 Output: 5 Explaination: 4=4 4=3+1

Consider the following recursive algorithm Algorithm Q(n)// Input: a positive integer nif n == 1 return 1else return Q(n-1)+2*n-1 1) Set up a recurrence relation for this function’s value and solve it to determine what this algorithm computes. 2) Setup a recurrence relation for the number of multiplication made by this algorithm and solve it to find the total number of multiplications that are executed.

If |V| = n and |E| = m, the running time complexity for Dijkstra's algorithm if implemented by an array is    Question 28 options:   O(n+m)   O(nm)   O(nlogm)   O(n^2)

Please help with question: Determine the running time of the following algorithms. Write summations to represent loops and simplify. Show all work. If bounding is used, the upper and lower bounds must only differ by a constant.  Note:  This is not the line-by-line analysis method. Loops are inclusive.