1.
Write a C language program which converts the first letter of each word to uppercase. Your input must
come from standard input. The processed lines of the text must be printed onto standard output.
You must provide an algorithm in the form of a pseudocode in a file ass1a1.txt. All your source code
must be given in a file ass1q1.cpp.
2.
Write a C++ function called merge which take two sorted arrays of integers and efficiently merge the
sorted arrays to produce a single sorted array. The function prototype of the function must be as
follows:
void merge(int outArray[], int inArray1[], int inArray2[], int inArray1Size, int inArray2Size)
You can assume that outArray has sufficient size. You must provide your function and the driver
program (i.e. a test program) in a file ass1q2part1.cpp. Provide the algorithm of the merge function in a
text file ass1q2part1.txt.
Now consider your own C++ class called BigNumber which can work with of three times the size of
typical C++ integers. Provide the definition of such a C++ class. Your class should have a member
function called lessThan which takes another BigNumber as an argument and compares with itself. The
function returns true if the argument is larger and otherwise it returns false. You must provide at least
one constructor which sets the BigNumber in addition to the member function lessThan. Provide an
updated merge function similar to above merge function, which can merge arrays of sorted BigNumbers.
Provide a driver program. All the source code must be provided in a file ass1q2part2.cpp.