Assertion reasoning question:

Assertion(a) : Let L is recursive enumerable language and problem X is defined as X: Is L=Φ? is not recursively enumerable

Reasoning(r): X violates the condition that says. if L is an infinite set in S, a set of recursive enumerable languages, then there is some finite subset L prime of L that is in S

Which of the following is true?

- Both a and r are true and r is the correct reason for a
- Both a and r are true, but r is not the correct reason for a
- a is true , r is false
- a is false, r is true

Please answer with explanation