For E= {a, b}, construct dfa's that accept the sets consists of (i) All strings with no more than three a's (i1) All strings w, where |wmod 3 = 0.

Let A = {2,7,8}, B = {-1,2,6,7}, C = {2,4,6,8,10}, D = {{7},{2,4},{6},2 ,8}List each set starting with lowest cardinality to highest. List elements in ascending order. Note that any answer that should be a set MUST be entered using set notation with no spaces. What is the power set of A? _______________________ Answer is not {Ø,{2},{7},{8},{2,7},{7,8},{2,7,8}}

In AList class, we have the get function to return an item at a particular position in list indexed by i. For example, let L=[1,2,3]. A call to L.get (1) will return 2. Write in the answer an enhanced get function to accept negative indices. Specifically, the last item has index -1, the second last item has index -2, and the i-th last item has index -i. For example, let L=[1,2,31. A call to L.get (-1) will return 3. A call to L.get (-2) will return 2. A call to L.get (-3) will return 1. Below is a skeleton of the AList class: template class AList { private: /** The underlying array. */ ItemType *items; /** Stores the current size of the list. */ int count; /** Max number of items allowed. */ int maxCnt; public: // Other functions omitted... ItemType get (int i) { // Copy this function in the answer and write code below this line. } ;

a. Is 3 ∈ {1, 2, 3}? b. Is 1 ⊆ {1}? c. Is {2} ∈ {1, 2}?

F4

Java

Implementing Set Operations The code template initializes two sets, A and B containing lower case characters as elements.Block 1 computes A-B and prints out the resulting set.In Block 2 write code to compute B-A and output the resulting set.In Block 3 write code to compute A⊕B and output the resulting set. Note that according to the definition of a set, the order of the elements does not matter. In this code, the elements of a set are printed in sorted order so that your output will match the expected output in the test cases. main.py # Initialize sets A and BA = { 'a', 'b', 'c', 'd', 'e', 'f' }B = { 'c', 'd', 'f', 'h', 'j', 'k' } print('A = ', sorted(A))print('B = ',sorted(B))print(' ')#Block 1: computes and prints out the set A - B AminusB = set()for element in A: # this line runs through every element in Aif not(element in B): #A - B is the set of elements that are in A and are not in BAminusB.add(element) # Add it AminusB every element in A if the element is also not in B  print('A…

A set is a container that stores a collection of sorted unique elements. When we use a sorted linked structure to implement Set ADT, the time complexity of find(x), insert(x) and remove(x) are all O(n). Group of answer choices True False