Homework 5, Ackermann's.

The goals of this homework are:

Implement a recursive function in MIPS assembly language.

Write an assembly language program to compute the first 20 values in a table of values for Ackermann's Function.

Your program should output the following table:

+---+---+---+---+---+---+
|M\N|  0|  1|  2|  3|  4|
+---+===+===+===+===+===+
| 0 |  1|  2|  3|  4|  5|
+---+---+---+---+---+---+
| 1 |  2|  3|  4|  5|  6|
+---+---+---+---+---+---+
| 2 |  3|  5|  7|  9| 11|
+---+---+---+---+---+---+
| 3 |  5| 13| 29| 61|125|
+---+---+---+---+---+---+

You probably should not compute any values higher than this in either dimension.

Please use the following definition for Ackermann's function

         / n+1,             if m = 0
A(m,n) = | A(m-1,1)         if n = 0
         | A(m-1, A(m,n-1)) if m>0 and n> 0
	 \ 0                if m < 0 or n< 0

Your program should follow the calling convention.

Your function must generate this table using your implmentation of Ackermann's function.

Please produce the table as given. Spacing matters.

Required Files

A tar file containing ALL of the code necessary to build and test your library.

Submission

Submit the assignment to the D2L folder Homework 5 by the due date.