Please help with this Python problem.

1. Find the worst case running time in terms of the input n, using Big Oh notation, for the algorithm below. Briefly explain your answer.

def functionA(n):

t = 0

for i in range(n+3):

for j in range(7+n):

for k in range(7):

t += j + 1

return t