Write a MIPS assembly language program that implements the following recursive function: if n <=6 if n > 6 function1 (n) = (n % 2) + 4 function1(n-5)/n + function1(n-3)*7 -n *see the pesudo-C code below as a reference: 1 void main() 2 - { 3 int ans, n; 4 printf("User Integer:\n"); 7 scanf("%d", &n); ans = function1(n); 10 11 printf("Solution: %d\n", ans); 12 13 return; 14 } 15 16 int function1(int n) 17 - 1 if (n <= 6) { int ans1 = (n % 2) + 4; return ans1; } else 18 19 - 20 21 22 23 { int ans1 = function1(n-5)/n + function1(n-3)*7 - n; return ans1; } 24 25 26 27 28 } sample output: User Integer: 13 Solution: 114

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...
icon
Related questions
Question
Write a MIPS assembly language program that implements the
following recursive function:
if n <=6
if n > 6
function1 (n) = (n % 2) + 4
function1(n-5)/n + function1 (n-3)*7 -n
*see the pesudo-C code below as a reference:
void main()
{
int ans, n;
4
printf("User Integer:\n");
7
scanf("%d", &n);
8
ans = function1(n);
10
11
printf("Solution: %d\n", ans);
12
13
return;
14 }
15
int function1(int n)
17 - {
16
if (n <= 6)
{
int ans1 = (n % 2) + 4;
return ans1;
}
else
18
19
20
21
22
23
{
int ans1 = function1(n-5)/n + function1(n-3)*7 - n;
return ans1;
}
24
25
26
27
28
sample output:
User Integer:
13
Solution: 114
Transcribed Image Text:Write a MIPS assembly language program that implements the following recursive function: if n <=6 if n > 6 function1 (n) = (n % 2) + 4 function1(n-5)/n + function1 (n-3)*7 -n *see the pesudo-C code below as a reference: void main() { int ans, n; 4 printf("User Integer:\n"); 7 scanf("%d", &n); 8 ans = function1(n); 10 11 printf("Solution: %d\n", ans); 12 13 return; 14 } 15 int function1(int n) 17 - { 16 if (n <= 6) { int ans1 = (n % 2) + 4; return ans1; } else 18 19 20 21 22 23 { int ans1 = function1(n-5)/n + function1(n-3)*7 - n; return ans1; } 24 25 26 27 28 sample output: User Integer: 13 Solution: 114
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY