Login or Create an Account to view the mark scheme, comment, and add to a test
Consider the following recursive algorithm:
[4]function mystery(n)
if n = 0 then
return 4
else
result = 4 + mystery(n - 1)
output result
return result
end if
end function
Using the table below as a guide, trace the execution of mystery(3)
![Question Image](https://res.cloudinary.com/n7-education/image/upload/v1685945954/user-content/261b3d92-2258-47f6-9232-e6ef72154f43/4a5175a3-ef60-47fc-a64b-9344e644ae99.jpg)
Short Answer4 MarksPremium
9 Uses11 Views0 Likes