Consider partitioning the list {1,4,0,1,1,1,2,3,1,0,4,4,1,2,0,1) where the first element of the array is used as the pivot. A) Show the results of using the first partitioning algorithm on the array. B) Do the same thing except where the the inner loops of the first algorithm are: while (a[++i].compareTo(v)