1.[30] Take two different arrays of integers of size m and n as input from the user
(m and n are also taken as input). Implement the 
following functions 
a. Print the union of two arrays
b. Print the intersection of two arrays.
c. Print the difference of the two arrays.

The definition of array union, intersection and difference operations are in
accordance with the set operations (i.e. think of each array as a set)

2. [40] Write a program that takes an array of size 10 as input from the user
andleft rotates an array k places. Note that k has to be taken 
as input from the user and it can be negative as well, in which case, the array
should be right rotated k times. Also if k is 0 then 
the rotated array is same as the original array.

For example,
if the input is
0 1 2 3 4 5 6 7 8 9 and k is 2,
the output should be
2 3 4 5 6 7 8 9 0 1

If the input is
0 1 2 3 4 5 6 7 8 9 and k is -3,
the output should be
7 8 9 0 1 2 3 4 5 6

BONUS MARKS: Write the program without using another temporary array.  You can swap
two elements of the array.  Also, you cannot simply left rotate the array k times by
shifting it through 1 place each time. 

3. [30] For an array A of integers (both positive and negative), find all triads (i,
j, k) such that A[i] = A[j]+A[k]. The array should be
input from user. Note that since addition is commutative, the triad (i, j, k) is the
same as (i, k, j). The commutative triad should
not be printed.

Example:

Enter the numbers : 2 3 5 6 8 4 4
The triads are:
1 :  2  0  1
2 :  3  0  5
3 :  3  0  6
4 :  4  0  3
5 :  4  1  2