M1 : language of all strings ends with a
M2 : language of all strings ends with b
all strings over alphabet {a,b} either ends with a or ends with b,
hence intersection of these languages will result an empty set { }.
so, there will be only 1 state which is not final.