Use pumping lemme or closure properties to prove the language is regular or not

(A). L = {w : n_a(w) > n_b(w),w {a,b}}

(B). L = {bⁿa^k : n > 0,k > 0}{aⁿb^k : k > 0,n > 0}