(define XOR-GATE (lambda (a b)

(cond (.....

*Using previously defined AND -GATE ,OR-GATE, NOT-GATE (you don't have to define those assume it is done)

It should be fairly simple i just get 1 1 1 1 for all possible outputs. In scheme DrRacket please. Thank you!!

2 Write a Scheme procedure to simulate the XOR gate, shown in the diagram in Figure 2 You must use AND, OR, and NOT gates that you defined in question 1 to implement XOR. In infix notation, c ((NOT a) AND b) OR (a AND (Not b))) (2 points) XOR Figure 2. Logic gate XOR, where c ((NOT a) AND b) OR (a AND (Not b))) 2 Write a Scheme procedure to simulate the XOR gate, shown in the diagram in Figure 2 You must use AND, OR, and NOT gates that you defined in question 1 to implement XOR. In infix notation, c ((NOT a) AND b) OR (a AND (Not b))) (2 points) XOR Figure 2. Logic gate XOR, where c ((NOT a) AND b) OR (a AND (Not b)))