ImprovedBreakpointReversalSort is the algorithm we use to solve the homework and exam

problems. Here is the logic of the algorithm.

Choose decreasing strip with the smallest element $k$

Find $k-1$ in the permutation

Reverse the segment between $k$ and $k-1$

If there is no decreasing strip and there are still breakpoints flip an increasing

strip to make a decreasing strip

Prob lem $1.$ Perform the ImprovedBreakpointReversalSort algorithm with $=34658172$ and

show all intermediate permutations $($break ties arbitrarily$).$

Problem $2.$ Perform the ImprovedBreakpointReversalSort algorithm with $=347692158$

and show all intermediate permutations $($break ties arbitrarily$).$