Given the code below, what does the stack look like the 4th time the program goes to the label "recurse:" You can assume the following:
-RBP represents the value of the base pointer at the time it is pushed to the stack.
-addr_call1 represents the value in the RIP register that gets pushed to the stack whenever the first call fibo_r instruction is run.
-addr_call2 represents the value in the RIP register that gets pushed to the stack whenever the second call fibo_r instruction is run.
-The stack grows upwards.
-You do not have to worry about what happened on the stack prior to running this code.
-The function is called with 5
section .text
global fibo_r
fibo_r:
push rbp
mov rbp, rsp

CMP rdi, 1
JG recurse
move:
mov rax, 1
JMP END
recurse:
DEC rdi
push rdi
call fibo_r
pop rdi
push rax
SUB rdi, 1
call fibo_r
pop rdi
ADD rax, rdi
END:
POP RBP
ret
1. RBP
addr_call2
5
RBP
2. RBP
addr_call2
3
RBP
addr_call1
4
RBP
3. RBP
addr_call1
2
RBP
addr_call1
3
RBP
addr_call1
4
RBP
4. RBP
addr_call1
3
RBP
addr_call1
4
RBP
5. RBP
addr_call1
4
RBP
6.RBP
7. RBP
addr_call2
4
RBP
8. addr_call2
3
addr_call1
4
RBP
9. RBP
addr_call1
2
addr_call1
3
addr_call1
4
RBP
10. RBP
addr_call1
2
RBP
addr_call1
3
RBP
addr_call1
5
RBP
11. RBP
addr_call1
3
RBP
addr_call1
5
RBP