The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

• [A] Stack
• [B] Set
• [C] List
• [D] Queue

• [A] 2,2,1,1,2
• [B] 2,2,1,2,2
• [C] 2,1,2,2,1
• [D] 2,1,2,2,2

• [A] no zero
• [B] many zero
• [C] higher dimenstion
• [D] none

• [A] 2 deletions and 3 additions
• [B] 3 additions and 2 deletions
• [C] 3 deletions and 3 additions
• [D] 3 deletions and 4 additions

• [A] Dynamic programming
• [B] Backtracking
• [C] Divide and conquer
• [D] Greedy method