Consider the even-odd language of strings, defined over ? ={a, b}, having even number of a’s and odd number ofb, s.
a) build an fa for the givenlanguage
b) build a transition graph (tg)that accepts the same language but has fewer states than fa.
c) find the regular expression(re) corresponding to tg accepting even-odd language (show all possiblesteps)

Larry sent an email to andy. andy didn't open larry's email but still understood what the message was. how did andy determine the message without opening the email?

Consider a byte-addressable computer with 16mb of main memory, a cache capable of storing a total of 64kb of data and block size of 32 bytes. (a) how many bits in the memory address? (b) how many blocks are in the cache? (c) specify the format of the memory address, including names and sizes, when the cache is: 1. direct-mapped 2. 4-way set associative 3. fully associative

Select all that apply. which of the following are proofreading options included in microsoft word? spell check find replace grammar check formatting check