Question 1 Incorrect For a language defined by the regular expression b*b*ab*, which of the following strings belong to the language? Mark 0.00 out of 2.00 Select one: X Flag question a. bbab b. ab C. b Od. All of the above e. None of the above Question 2 The set of strings that are accepted by a finite-state automaton A is Incorrect Select one: Mark 0.00 out of 2.00 a. An initial state of A P Flag question O b. A regular language c. The language accepted by A Od. The Kleene closure e. None of the above Question 3 Incorrect In a graph with vertices v1, V2,..., Vm and adjacency matrix a, the number of walks of length n from v; to v; is given by Mark 0.00 out of 2.00 Select one: P Flag question a. The matrix An-1 b. The jith entry in An C. The ijth entry in An-1 X d. The jith entry in An+1 e. None of the above Question 4 Which best describes the number of edges that are incident on a vertex? Incorrect Mark 0.00 out of 2.00 Select one: P Flag question a. The degree of the vertex b. The total degree of the graph o c. The order of the graph x d. The size of the graph e. None of the above