Write a recurrence relation describing the worst case running time for the algorithm below and explain how you derived the recurrence relation equation in detail for full credit.

int func6(A,n)

for i=1 to n

for j=1 to floor(n/3)

A[i]=A[j] + A[i]

x=func6(A, floor(3*n/10));

return x;