Week 10: Wednesday
------------------

Q1. (50)

Input an integer array a of size 15 from the user. The array can have multiple
occurrences of elements. You have to remove the multiple occurences of elements
and store the distinct elements in a new array. The memory for the new array
has to be dynamically allocated using malloc such that its size is same as the
number of distinct elements in A.

For example,
if array a is 3 4 5 1 4 5 2 4 6 4 2 5 6 3 5
then the new array is
3 4 5 1 2 6
of size 6.   

Q2. (50)

Input an array s that stores 5 strings of maximum size 10. Input another string
t from the user of maximum size 5. Assume that the strings do not contain any
blank or whitespace character.

Write a function that finds the index of first occurrence of substring t in
each string of s. If the substring is not found, it returns -1. Write another
function that returns an integer array of size 5 that stores the index of first
occurence. Return the integer array as a pointer.

For example,
if the array s is "abcdefdef" "agfgdefjhg" "defdd" "wdwdwdwd" "efefd"
and t is "def",
then after calculating the index of t in each string of s the function returns
the pointer to the array
3 4 0 -1 -1