What are the big O runtimes of the following algorithms.  Assume reasonable implementations for each method if one is not provided.

1. reverse an array.  Assume some reasonable implementation.

2. count how many times a particular value occurs in an array.

3. see if a value exists in the first 1 million entries in an array.

4. check if all numbers in an array are the same.  Give worst case and best case.

5. 

public int fib(int n){
	if( n <= 1 ){
		return 1;
	}else{
		return fib(n-1) + fib(n-2);
	}
}