List the inversion pairs (swaps) needed to sort the numbers 9, 25, 8, 11, 36, 5 in ascending order using bubble sort algorithm. (Note: In bubble sort, number of swaps required = number of inversion pairs, for example (9,8))