Given a list of strings lst and a list of integers p, reorder lst so that every lst[i] gets placed to p[i]. I am trying to solve this by decomposing permutation p into a product of transposition(swaps) and then use those swaps to reorder lst.. can anyone give me the code for decomposing a permutation into a product of transpositions? Note it has to be done in O(1) space..otherwise it is trivial