L. Assuming each ASCI character is stove as a byoe (8 bits) REING USED FOR EVEN-PARITY whal would 'h: string "Ficr"" he sa salieno: of hcuskeimal Fienup 2 The following Hamming codeword coatains & bits of duta (D t Dal. and four (P. P.. P, and Pi) evesparity bits to allow for one bit error detection and comection. Detenmice if an eor has occured nd cocrect it f 3. Determine the Hamming codeword if the 8bits of data D to D) are 0101 1101 i.e. what re the values of PL P. and Let D-101100101011101016 bit data) with G-xis 100101, (degree 5 polynomial a) Detenmine the CRC remainder. 20010 aprend 5 0% since G has 6 bits. lhe inler will hae bis b) Devermine the codewerd se which is the data appended with the (5-bit) remaindes. e Divide the codewondley the generx1 IM101gto check for an ero Remsine should he d) Introlua: some random cmer nlo1hcxslevamd ard deck fer an crmr hy dividing hv to emerskr G-x' + +11001O) Double Compienert Lo For the Boolean function F represented in the truth table a) write the sum of products (SOP) Boolen expression Le.. where are the I's are in the F coluP-ABCD+ABCD+... b) draw the ussimplified cireuit oe this SOP expression, and detentmine the numher orle deays and eincuil complesity(e gales+s c) using a K-map (or the identities of Boolean algubra), simplify this fumction F as much as you can d) draw the simplitied circuit for your aaswer in part (c). and detentite the manter or 8ane delays and circuit complexity (# 8aes + inputs imo those gate) of this circuit 6 Draw the iusing AND, OR, and NOTisto implemcnl a 32-inpt ol-uput mulipkxer (MUX) Your MUX should have 5 comrol wins e4.c> c' to scloct which impul s suitched tilho smgle output (You can u avoid drawing all the AND-pates of the whole MUX, but show enough to emonstrale your understanding of MUXs Assume there is a 9-input limit to AND and OR gates. b) How many gate delays does yor MUX have