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

Which are steps taken to diagnose a computer problem? a) reproducing the problem and using error codes b) reproducing the problem and troubleshooting c) using error codes and troubleshooting d) using error codes and stepping functions

Program using c++ only on visual studio pig is a simple two player dice game, played with one die. the first player to reach or surpass 50 is the winner. each player takes a turn rolling the dice. they add to the pot with each roll, having to decide to roll again and increase the pot, or cash out. the risk being they could lose the amount they’ve accumulated into the pot. the rules for each player’s die roll. 1. roll the dice. a. if user rolled a 1, i. the pot gets set to zero ii. the other player goes to step 1. b. a roll of 2-6 is added to the pot. 2. user can choose to hold or roll again. a. choice roll. return to step 1. b. choice hold. i. increment player score by the pot amount. ii. pot gets set to 0. iii. second player gets to roll and goes to step 1. program requirements: ● before each opponent begins ○ output the score for the person and the computer. ○ output the opponents whose turn is beginning and ask the user to hit enter to continue. ● with each dice roll. ○ output the die value, and amount of the round pot. ○ if it’s the users roll ask if they want to roll again ( r ) or hold ( h ). your program should allow r, r, h or h as valid input. if input is anything else, ask the user again until valid input is obtained. ○ the ai will continue playing until the round pot is 20 or more. ● once a player’s score is greater or equal to 50 then they have won, it will no longer ask if they want to keep rolling the die or not. ● once there is a winner ○ score totals are output along with who the winner was. user or computer ○ player is asked if they want to play again y or n. valid input should be y, y, or n, n. ● when a new game starts the starting roll goes to the player that did not roll last. if the user rolled last in the previous game, then the computer rolls first and vice versa. when the program first begins, the player will make the first roll of the first game. development notes : ● you will need a way to roll dice in your program. the rand() function works well, but returns an integer. if we want numbers 0 – 9 we can get the value modulus 10. ● call srand() with a value to seed it. it’s common to seed it with the current computer clock, include ctime, and then call srand(time(

Consider a direct-mapped cache with 216 words in main memory. the cache has 16 blocks of 8 words each. it is a word-addressable computer (rather than a byte-addressable computer which we normally discuss). (a) how many blocks of main memory are there? (b) what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, cache block, and block offset fields (if they apply)? (c) to which cache block will the memory reference db6316 map?