Fork Bubble Sort

Objective: Bubble sort! We all know when it comes to sorting algorithms; bubble sort is one of the last one's you should use. In this project you will design a C program that will create a child process that will run bubble sort on an array. More details below!

Requirements:

• Ask the user to provide the size of an array.
• Once the size of the array is given, use malloc to allocate the memory space for the array.
• Ask the user for values to be stored into the array then store them in the array you created
• Utilize the fork() system call to create a child process
• Have the child process perform bubble sort on the array (from smallest to largest)
• Have the child print the sorted array to screen
• Have the parent process wait until the child has finished executing with the wait() system call
• Have the parent process do bubble sort on the array (from largest to smallest)
• Have the parent process print the sorted array to screen.

EXAMPLE EXECUTION:

Notice the inputs see image.