QUESTION 10: Decidability [10) (a) Use the algonthm that elminates symbols from a regular expression in steps to show that b(aa + bb)(ab)+(A +a") accepts at least one word State whether the following are true or false (0 There is an effective procedure to decide whether a given FA accepts any words (o) There is not an effective procedure to decide whether two FAs are equivalent (2) (b) (c) Let F be an FA wth N states State the theorem or test that can be used to determne whether Faccepts an infinite language (d) Using the theorem or test gven in (c, determine whether the following FA acceptsan nfinite language o, b o, b QUESTION 10: Decidability [10) (a) Use the algonthm that elminates symbols from a regular expression in steps to show that b(aa + bb)(ab)+(A +a") accepts at least one word State whether the following are true or false (0 There is an effective procedure to decide whether a given FA accepts any words (o) There is not an effective procedure to decide whether two FAs are equivalent (2) (b) (c) Let F be an FA wth N states State the theorem or test that can be used to determne whether Faccepts an infinite language (d) Using the theorem or test gven in (c, determine whether the following FA acceptsan nfinite language o, b o, b