Avoiding patterns of length three in compositions and multiset permutations

We find generating functions for the number of compositions avoiding a single pattern or a pair of patterns of length three on the alphabet {1,2} and determine which of them are Wilf-equivalent on compositions. We also derive the number of permutations of a multiset which avoid these same patterns and determine the Wilf-equivalence of these patterns on permutations of multisets.