1.  (10 Points) Write a program that takes in 3 integer inputs, and outputs the maximum of the three inputs.
> Input integer 1: 4
> Input integer 2: 5
> Input integer 3: 6
> The maximum of the integers you inputted is: 6

2.  (10 Points)  Write a program that prints out the first n numbers in the fibonacci series.  Let a_n be the n-th number in the fibonacci series.  Let a_0 = 1, a_1 = 1 and a_n = a_n-1 + a_n-2.  For example the first 5 numbers of the fibonacci series are:
1, 1, 2, 3, 5

> How many fibonacci numbers do you want to see? 6
> 1,1,2,3,5,8

3. (10 Points)  Write a program that does exponentiation, given an integer base and a non-negative integer exponent.  Write your own exponentiation algorithm, don't use the one in the math libraries.
> Give an integer base: -2
> Give a non-negative integer exponent: 3
> (-2)^3 = -8

NOTE: The int type has a finite range.  On most computers this is between -2^31 and 2^31.  Most computers will only be able to print correctly the first 46 or so fibonacci numbers.  After that, the numbers are so big, that they overflow the maximum size of the int type.  In addition, one can easily overflow the exponentation program.  Later on, we'll see how we can fix this.