Question 2 If the set of stimuli (inputs) S contains 3 elements: S = {T, F, L}, how many elements in S* are of length 3? Hint: Here we consider all possible elements in S* that are of length 3, not just those that end up being enumerated. 6 3 27 . 9 Question 4 Consider the following simple sequence enumeration: Sequence Response Equivalence lambda 0 a r b omega aa 0 a ab lambda Note: lambda denotes the empty sequence, and omega denotes the illegal response. If one converts the above enumeration table directly to a state machine diagram, how many states would be there? Hint: Consider both legal and illegal states. O2 0 O 5 Question 5 Consider the following simple sequence enumeration: Sequence Response Equivalence lambda 0 b omega 0 a ab lambda Note: lambda denotes the empty sequence, and omega denotes the illegal response. Let BB denote the black box function. What is BB(aab), i.e., the software's response to the input sequence aab? Or omega Don't know (as it is not shown in the table) Question 6 Consider the following simple sequence enumeration: Sequence Response Equivalence lambda 0 a b omega 0 a ab r lambda Note: lambda denotes the empty sequence, and omega denotes the illegal response. Let BB denote the black box function. What is BB(babb), i.e., the software's response to the input sequence babb? Or Don't know (as it is not shown in the table) omega