look up the attachment and make sure of the ones that I did

No.3 (10 points)

Write a reduced expression for the Boolean function defined by the following K-Map:

No.4 (10 points)

Using basic identities of Boolean algebra reduced the following Boolean function:

F = (X + Y) (X + Y)

No.5 (10 points)

The output function of a logic circuit is

F(X, Y, Z) = X Y Z + X Y Z + X Y Z + X Y Z

Using this function draw a K-map and find out the reduced function .

...

3