I am looking for some much needed help please with one question on the Computer Science Path, Math for Computer Science Exam, Part 2.

The question states: Fill in the blanks to match each statement with the type of proof strategy that should be used to prove, or disprove, that statement.

- Prove that all the set of numbers from 1 to 10 are less than 11.

Proof Strategy: ________ - Prove that all numbers less then 5 are odd.

Proof Strategy: ________ - Prove that, if a graph has “n” vertices, it has “n-1” edges.

Proof Strategy: ________

The options are: Contrapositive, Counterexample, Induction, Direct, Existence, Exhaustion (Once an option is selected, it cannot be used elsewhere in the response).

I´ve tried this exam 3 times and I haven’t be abble to pass it, I’ve already check the lesson and articles neither way I think this question can have multiple answers, Theres’s another post about this but has been closed and the answer was sent by DM

I really need to complete this exam ASAP due my membership is soon to expire