2. [10] Assume array A, indexed from 1 to n, in the BUBBLE_SORT algorithm below. BUBBLE SORT(A, n) 1. for it 1 to n - 1 do 2. for jt 1 to n do 3. if (A[j] > Aj + 1]) 4. SWAP(A[j], A[j + 1]); How many times is each line executed on the input [11, 51, 26, 42, 8]? Line No L1 L2 L3 L4 # Times Executed