please solve parts 3 and 4, note that this question is not a graded question, please don't reject it Part 2.4: Example #31. What is the cycle count when the programfinishes?2. How many new lines of instructions were added(diff example_2.s example_3.s)?3. What is the lowest value of the stack pointer (sp)during the program?4. What registers are used for the arguments tosubroutines and the return values? .globl main# Defines.eqv PRINT_INT 1.eqv PRINT_STR 4.eqv EXIT_CODE 93.datainput:.word 6output:.word 0result_str:.asciz "!= ".textmain:lw a0, inputjal fact_funcla to, outputsw a0,0(t0)exit:lw a0, inputli a7, PRINT_INTecallla a0, result_strli a7, PRINT_STRecalllw a0, outputli a7, PRINT_INTecallli a0, 0li a7, EXIT_CODEecallebreakaddi sp, sp, -16SW SO, 0(sp)SW S1,4 (sp)sw s2,8(sp)sw ra, 12 (sp)mv s0, a0li to, 1ble s0, t0, done_factaddi s1, s0, -1li a0,1li s2,1blez s1,done_factaddi s2, s2,1mv a1, s2jal mul_funcaddi s1,s1,-1j do_factlw s0, 0(sp)lw s1, 4(sp)lw $2, 8 (sp)lw ra, 12(sp)addi sp, sp, 16retaddi sp, sp, -12sw s0, 0(sp)sw s1, 4(sp)sw ra, 8(sp)mv s0, a0mv s1, a1mul a0, s0, s11w s0, 0(sp)lw s1, 4(sp)lw ra, 8(sp)addi sp, sp, 12retfact_func:do_fact:done_fact:mul_func:# The location for the input data# allocates 4 byte set to 6# The location for the output data# allocates 4 byte set to 0# The location for the result string data# allocates 1 byte per chacter plus null character# Label for start of program#Load input Value# Jump and link (save return address) to factorial function.# Load output address to to# Save output value to output memory location# Load Input value into ao# System call code for print_int code 1# Make system call# Put result_str address in a0# System call code for print_str code 4# Make system call# Load output value into ao# System call code for print_int code 1# Make system call# Exit (93) with code 0# System call value# Make system call# Finish with breakpoint# Make room to save values on the stack#This function uses 3 callee save regs.# This function is responsible for them# Each register is 4 bytes# The ra needs to be saved in case jal is used again# Save the argument into so# Loads the value 1 into a to# If Input is 1 or less, then skip to end# Put input-1 into s1# Load 1 in a0 (caller saved/ argument)# Load 1 in s2 (callee saved)# If s1 is less than or equal to zero then jump to end# Increment s2 by 1#Move s2 into a1 (argument)# Multiply subroutine, argument (a0,a1) return value (a0)#decrement s1 counter# jump to top of loop to do next factorial until s1 is 0# Restore any callee saved regs used# Each register is 4 bytes## Retore correct return address# Update stack pointer# Jump to return address# Make room to save values on the stack# This function uses 2 callee save regs.# This function is responsible for them# Save the return address# Save the arguments in callee save regs## Multiply argument and output to a0# Restore any callee saved regs used# Each register is 4 bytes# Restore return address# Update stack pointer# Jump to return address

3. The stack pointer (SP) points to the top element of the stack. The current value of SP is…

Answered: 3. What is the lowest value of the…

3. What is the lowest value of the stack pointer (sp) during the program? 4. What registers are used for the arguments to subroutines and the return values?

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Can you please separate 2 and 3. As this quite confusing which explanation is for 2nd part and which is for 3rd part.
Not sure how to do this. Need help
Kevin plans to use a Boolean operator since he wants to learn about two separate things. In order to receive accurate search results, Kevin must choose the proper Boolean operator.
Click to see additional instructions Given the following confusion matrix, calculate the False Postive Rate for B. FPR of B = ACTUAL VALUES A B PREDICTED A 6 VALUES B 10 C 4 20 ## 9 4 20 C SUM 2 60 %
Assuming you want to follow the ABC method, what sequence should you follow?
How do you take notes in the class? Discuss. (Please dont reject it, i did not buy credits to get rejected please Answer)
A student took four quizzes in a term and would like to compute their average. He also would liketo know if the average has a passing mark. Note that grade lower than 75% is failed.
Answer the 2 questions, will upvote if complete, short solution/explanation will do
Question 25 The following two statements are logically equivalent: (p → q) ∧ (r → q) (p ∧ r) → q You can use truth tables to determine equivalency Group of answer choices True False
If a team is unable to complete all the points of work allocated for an iteration, the team should use the number of points that were completed as basis for the work for the next iteration. True/False
How can I code these in Python for a Sudoku puzzle? 1) A proper backtracking solution 2) Print out the number of times backtracking is needed 3) Improve the solution using constraint propagation 4) Improve the solution using the Minimum Remaining Values logic. Please note, the server will return a different starting position every time. You are not meant to hard-code the positions.You only need to present the final solution you get to.
The answer is just an option. I still don't know which one I should select