For each of the following languages, specify if the language is regular or non-regular. You must support your if the language is non-regular, explain why; if the language is regular design a finite automaton that accepts the language. The alphabet is {a, b, c}.

(a) {a i b 2j | i, j ≥ 1}

(b) {a n b n+mc m | n, m ≥ 1}

What must you do before formatting a paragraph?

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

Corey set up his presentation for delivery to his team.the information he had to convey was critical to their job performance.he knew he would need a lot of time to explain each point