I need help with problem 3-4 and 3-5 please.

Problem 3-4. (9 points) Jones & Pevzner, Problem S Given permutations ? and ?, a breakpoint between ? and ? is defined as a pair of adjacent elements ?? and ??+1 ln ? that are separated in ?. For example, if ?-143256 and ?-123465, then ?1 1 and ?2 4 in ? form a breakpoint between ? and ? since 1 and 4 are separated in ?. The number of breakpoints between +01432567 and ?-01234657/s three (14, 25 and 67), while the number of breakpoints between ? and is also three (12, 46 and 57). Given permutations 124356, -143256, and 123465, compute the number of breakpoints between: 144 (read the description between 5.I1 and 5.12). (1) and (2) T and (3) n2 and m (Use the first permutation as the given sorting order. For example, given and 5 are not.) 123465, 4 and 6 are adjacent and 4 Modify DPChange (on page 151 and below) to return not only the smallest number of coins but also the correct combination of coins. DPCHANGE(M,c, d) 1 best NumCoinso0 2 for m1 to M best NumCoinsm00 for1 to d if m if bestNumCoinsm-e +1