For this question consider the same 4-variable Boolean funct…

For this question consider the same 4-variable Boolean function: f(J,K,L,M)= KL + J’M + JL’  It is possible to also implement this function using an 8-1 MUX. Show one way it can be done (there are 4 ways it can be done).   Type out how you will adjust your inputs such that you can implement the function with the smaller 8-1 MUX.

Set-Associative Cache The next 4 questions are all parts of…

Set-Associative Cache The next 4 questions are all parts of the same multipart question. All the questions refer to the same cache as described below. Consider a 2-way set associative cache with the following specification: 32 blocks Each block has 4 words Each word has 8 bits The address is 12 bits long

c. Bonus (1 point) Calculate the size of the cache.  NOTE: P…

c. Bonus (1 point) Calculate the size of the cache.  NOTE: Please input the number ONLY, in bits OR bytes. Consider the same 2-way set associative cache we have been working with (details repeated below). 32 blocks Each block has 4 words Each word has 8 bits The address is 12 bits long