Give regular expressions with exponentiation that generate the following languages over the alphabet {0,1}.

^Aa. All strings of length 500

^Ab. All strings of length 500 or less

^Ac. All strings of length 500 or more

^Ad. All strings of length different than 500

e. All strings that contain exactly 500 1s

f. All strings that contain at least 500 1s

g. All strings that contain at most 500 1s

h. All strings of length 500 or more that contain a 0 in the 500th position

i. All strings that contain two 0s that have at least 500 symbols between them