We can divide the people into three groups: Alice and Bob, Eve and Oscar, and the other six people. The number of ways of selecting $k$ people from the group that includes Alice and Bob, $m$ people from the group that includes Eve and Oscar, and $n$ people from the remaining six people is
$$\binom{2}{k}\binom{2}{m}\binom{6}{n}$$
The problem requires that we select at most one person from the group consisting of Alice and Bob, either zero or two people from the group that consisting of Eve and Oscar, and the remaining $n = 5 - k - m$ people from among the remaining six people. Note that at most one means either $0$ or $1$ people since the number of people we select must be a nonnegative integer.
Let's consider cases:
One of Alice or Bob, neither Eve nor Oscar: If we select one person from the group consisting of Alice and Bob and no people from the group consisting of Eve and Oscar, we must select $5 - 1 - 0 = 4$ people from the remaining six people. There are
$$\binom{2}{1}\binom{2}{0}\binom{6}{4} = 2 \cdot 1 \cdot \binom{6}{4} = 2\binom{6}{4}$$
such selections.
Neither Alice nor Bob, neither Eve nor Oscar: As Robert Shore explained in the comments, this means all five people must be selected from the group of six people, which can be done in
$$\binom{2}{0}\binom{2}{0}\binom{6}{5} = 1 \cdot 1 \cdot \binom{6}{5} = \binom{6}{5}$$
ways.
One of Alice or Bob, both Eve and Oscar: If we select one person from the group consisting of Alice and Bob and select both people in the group consisting of Eve and Oscar, we must select $5 - 1 - 2 = 2$ people from among the remaining six people. There are
$$\binom{2}{1}\binom{2}{2}\binom{6}{2} = 2 \cdot 1 \cdot \binom{6}{2} = 2\binom{6}{2}$$
such selections.
Neither Alice nor Bob, both Eve and Oscar: Can you finish this case on your own?