Answer:
For question a, it simplifies. If you re-express it in boolean algebra, you get:
(a + b) + (!a + b)
= a + !a + b
= b
So you can simplify that circuit to just:
x = 1 if b = 1
(edit: or rather, x = b)
For question b, let's try it:
(!a!b)(!b + c)
= !a!b + !a!bc
= !a!b(1 + c)
= !a!b
So that one can be simplified to
a = 0 and b = 0
I have no good means of drawing them here, but hopefully the simplification helped!
Answer:
n = f = 7
loop f = gt(n,1) f * (n = n - 1) :s(loop)
output = f
end
Explanation:
Ash is the answer. Hope this helps
Answer:
are u sure this is the right question?
Explanation:
In think is C or B in my opinion
