Use the partition algorithm for the following array, [57, 45, 82, 87, 27, 72, 32, 57, 50, 33, 49, 8, 85, 71, 87, 38, 64, 27, 62, 19], choose element at index 0 as pivot element. Provide the partition results as well as the number of comparison and exchanges used. With the partition algorithm provided above, each call of SortUtilsisLessThan(...) s count as one comparison, and each of SortUtils.swa is count as one exchange. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 57 45 82 87 27 72 32 57 50 33 49 8 85 71 87 38 64 27 62 19 original Partition Result comparison exchange