1. [15 Points] For each of the following languages, prove or disprove that it is regular. (a). La = {uav : uv L), where L is any regular language over {a, b}. (b). Lb = {w : w {a,b)' and w = wR} (c). Le ba"b" : n,k20)