5. (10%) Let \( X = \{1, 2, 3, \ldots, 9\} \). Algorithm A lists all 6-permutations of \( X \) in increasing lexicographic order. Algorithm B prints all 6-combinations of \( X \) in increasing lexicographic order where each combination is printed as an increasing sequence. First, find the next five permutations that will be generated by algorithm A after the permutation 321978. Then, find the next five combinations that will be generated by algorithm B after the combination 123689.