Little Elephant and Bubble Sort

Little Elephant loves bubble sorting. Bubble sorting for any array A of n integers works in the following way: var int i, j; for i from n downto 1 { for j from 1 to i-1 { if (A[j] > A[j+1]) swap(A[j], A[j+1]) } } You are given an array B of n integers. Then the array A is created using array B as following : for each i (1 ), we set Ai = Bi + d with the probability Pi, otherwise Ai = Bi. Help L