How many different ways can the subsets of the set $\{a, b, c\}$ be arranged in a sequence so that each subset differs from the one before it by having exactly one element inserted or deleted?