Write it, run it, read the output

This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.

TASK

Implement the recursive function so the state (remaining, first, second) prints the seven Fibonacci terms in order. Make one recursive call after each printed term, updating the state to (remaining - 1, second, first + second).

0 1 1 2 3 5 8