ALL QUESTION COMPULSORY

Q1) Write a function which searches an element in a given array. Assume the given array is sorted, you must 
	use binary search algorithm for searching the element. Make sure the binary search is done recursively 
	and not iteratively. ( 30 marks)
	
Q2).Write a recursive function to calculate the number of configuration of n rooks
	on an n-by-n chessboard such that no two rooks can attack each other in the
	next move (i.e., no two rooks lie on the same row or same column). 
	Note you just have to print the number of possible configuration and not the configuration itself. (50 marks)
	

Q3) Write a function which reverses the string in place recursively.(20 marks)