you are halfway through !!!!

>M(1) = 1 <---No multiplications when n = 1

>Assume that the basic operation is multiplication.

T(n) = O(1) for n=1

For n=2, note that inner most loop will execute 2*2 times and this would be followed by a call to Function(1)

For n=3, inner most loop will execute 3*3 times and this would be followed by a call to Function(2) ...

i.e. ...

T(n) = O(n^2) + T(n-1) for n>1

this gives you your required recurrence relation

>M(1) = 1 <---No multiplications when n = 1

>Assume that the basic operation is multiplication.

T(n) = O(1) for n=1

For n=2, note that inner most loop will execute 2*2 times and this would be followed by a call to Function(1)

For n=3, inner most loop will execute 3*3 times and this would be followed by a call to Function(2) ...

i.e. ...

T(n) = O(n^2) + T(n-1) for n>1

this gives you your required recurrence relation