II. ARM7 6. [10 Pts] Consider a pseudocode for the BubbleSort algorithm as given below and write a C code for implementing the given BubbleSort procedure. As a test case, use it to sort the following array of integers in ascending order: 100, 50, -10, 30, 70, 60 procedure bubblesort ( A : list of sortable items ) n= length (A) repeat newn = for i=1 to n1 inclusive do if A[i1]>A[i] then swap (A[i1],A[i]) newn =i end if end for n= newn until n = 1