Show that the language {a^4 , a^9 , a^16, a^25 , . .} is regular.

well there are two answers for that.

1: you need 120 ones then that will equal up to 120.

2: you could also do one 100 and 2 tens.

those are the answers that i have thought of.

no association

step-by-step explanation:

if you have eyes and you can use them efficiently you can see that it just looks like random dots like do a line of best fit and like they're so spread out it's such a weak association you might as well consider it nonexistent

22

step-by-step explanation:

22