******************************************************************
*****************   Assignment #4 for CS341  *********************
*****                Due Monday 10/30/01                   *****
******************************************************************


The goal of this assignment is to gain experience in translating 
recursive function calls in a high-level language to assembly.


Write an assembly language program to recursively compute the values
of f(3) through f(15) where f(i) is defined by the following 
recurrence:


	f(i) = 4*f(i-1) - 3*f(i-2) - 5*f(i-3) + 3*i
	
	with f(0) = f(1) = 0 and f(2) = 1.



Each time f() is called, the following should be displayed:

  *** f() has been invoked for the jth time 
  *** f() has been invoked for the rth time with input parameter k
  *** Value of SP = n, Value of FP = p


Each time f() returns, the following should be displayed:

  *** The jth invocation of f() is now returning with return value m


Of course, for each invocation j will be distinct. Actual values
of j, k, m, n, p and r should appear on the screen.

Finally, your program should display the value of f(15).