We are given a permutation of numbers from 1 to n.
A permutation p1,p2,p3...pn, super, is defined as the minimum number of adjacent swaps required to sort the permu
