Array sorting, as the name suggests, is a technique to sort an array in either ascending or descending order. There are many algorithms available to sort arrays. In this lab, we will use an algorithm known as Bubble Sort. Bubble sort makes multiple passes through the array, compares adjacent items in the array, and exchanges them if they are out of order (either ascending or descending). Essentially, each item bubbles up to it's proper location. A helpful bubble sort demonstration is provided here. Given an array of integers, sort the array in ascending order using bubble sort. Template code: Template code is provided that reads in a seed value, generates an array of 10 random integers, and prints the values in the sorted array. You must write the missing code to sort the array in ascending order using bubble sort. Ex. Input: 1 Seed: 83 86 77 15 93 35 86 92 49 21 Sorted Array: 15 21 35 49 77 83 86 86 92 93 1 /* bra 2 Author: 3 Date: 4 Purpose: 5 */ 6 7 #include 8 #include 9 10 int main( void ) 11 { 12 // seed the random number generator 13 int seed; 14 printf("Seed: "); 15 scanf("%d", &seed); 16 srand( seed ); 17 18 1/ fill array with a set of random numbers 19 const int SIZE = 10; 20 int array[SIZE]; 21 for( int i = 0; i