1 | 1. L: List 2. n:  3. sum(L[i]-1 | i < ||L||)+1 n 4. G: {s:( n List)| ||s|| = 1 & ( x,y: ||s||. x < y  s[x] < s[y]) }  ||L|| c: ||L||, f:( L[c]  n). increasing(f;L[c]) & ( s: L[c] List. ||s|| = 1  ( x,y: ||s||. x < y  s[x] < s[y])  G(map(f;s)) = c) | 29 steps |