An abstract argumentation graph consists of argument nodes {a0, a1, a2, a3, a4} and the following attacks between arguments.

• Argument a1 attacks arguments a0, a1
• Argument a2 attacks arguments a0, a3, a4
• Argument a3 attacks arguments a1, a2, a4

Under different semantics, the graph may have alternative labellings, where arguments are labelled In, Out, or Undecided. Which of the following are true?

Select one or more:

There is a labelling under the grounded semantics in which argument a1 is In.

There is a labelling under the preferred semantics in which argument a3 is Out.

There is a labelling under the preferred semantics in which argument a1 is In.

There is a labelling under the preferred semantics in which argument a3 is In.

There is a labelling under the grounded semantics in which argument a4 is Out.