Given the algorithm below,write the recurrence relation that describes execution time T(n),knowing that the dominate operation is given values to the elements of the array x:
