For each language, either prove the language is regular (by creating an implementation with your choice of a DFA, NFA, RegEx, Regular Grammar, or using closure properties), or prove that it is not regular (by either using the pumping lemma or closure properties).

(f) {a' W ij > 0,i- j =5} (g) {a'Wij > 0, i- j l=s0} (h) {rx"r* {0}"}