1. String concatenation								30
Write a program to concatenate two strings s and t, and return the 
concatenated string.
The program should contain a function 
	char *strConcat(char *s, char *t), 
that does the work using pointers for referring to characters in the string.

2. Denomination break-up							30
Write a program that asks a user to give an amount to be paid in rupees
using smallest number of banknotes of denominations - 1, 10, 50 and 100.
The program should have a function which accomplishes this task. 
The prototype of this function should be
	void pay_amount(int amout, int *num_1s, int *num_10s, int* num_50s, int *num_100s)

3. Rabbit and carrot								40

A rabbit walk is defined by a sequence of jumps which starts from a 
location and returns back to the starting location. We can repesent such
a Rabbit walk by an array A of n numbers, where A[i] denotes the next 
array index to which the rabbit should jumps from the location i.
For example, the sequence: 2 3 4 5 0 1 indicates that the Rabbit follows
the jump sequence: 0->2, 2->4, 4->0 and stops. 

Your also given another array B of N numbers, such that
B[i] denotes the number of carrots available at location i.
Your task is to compute the number of carrots that a rabbit can collect
when it makes rabbit walk(s) from various start position(s).
A sample input is provided for more clarification(s).

Input:
The first line will contain a single integer N which is the size of the
    array (2<= N <= 10000).
The next line contains a series of N integers which define the array A.
The next line contains a series of N integers which define the array B.
You can be assured that all the calculations fit into a 32 bit signed 
integer type(int in C).

The input is given such that, a rabbit walk will always exist with
   start position as 0.

Output:
It should contain the number of carrots collected
when 0 is treated as the start location.

Sample Input:
6
2 2 2 2 -4 -4
2 3 6 3 0 1

Sample Output:
8