The maximum contiguous subsequence sum algorithm given in Figure 20 gives no indication of the actual sequence. Modify it so that it fills static class fields seqStart and seqEnd. For the change-making...

The maximum contiguous subsequence sum algorithm given in Figure 20 gives no indication of the actual sequence. Modify it so that it fills static class fields seqStart and seqEnd. For the change-making problem, give an algorithm that computes the number of different ways to give exactly K cents in change.