Consider the problem of sorting the given array in ascending order:
P = [1, 2, 3, 5, 4]
Consider two sorting algorithms Bubble Sort (BS) and Insertion Sort (IS). Let be the total number of comparisons done by BS on the elements of P and be the total number of comparisons done by IS on the elements of P.
Which of the following options is/are correct?
- A
- B
- CIS on P will perform only one swap
- DBoth BS and IS on P will make at least one unnecessary comparison (i.e., comparing elements that are already in correct order)

