The Given FA is DFA as there are transitions for every symbols of alphabet = {a,b} from every state.
The complement of FA is ,
Since it contains loop over Final state, it can accept any number of a's and b's at final state which leads to Infinite language set.
Option a is correct