Given the permutation of (+1, -3, -4, -2, +6, +7, -5, +8), 1) using the greedy approach (p304) to find a sequence of reversals to sort it into a identify permutation (+1, +2, +3, +4, +5, +6, +7, +8); 2) What are the breakpoints in this permutation? 3) Build the breakpoint graph from the permutation; 4) How many red-blue alternating cycles in the breakpoint graph? 5) what is the minimum number of reversals to sort the permutation to the identity permutation?