00:01
In this question, it is asking us to write the inputs when line 2 is stuck at 0.
00:10
Line 2 is stuck at 0.
00:12
So we can write x2 input will 0 always.
00:17
So accordingly we can write all the other expressions like here x1, x2, x3, x4 and x5.
00:33
All these inputs we can write.
00:36
So since there are 16 combinations we can take.
00:42
So these combinations will be 0, 0, 0, 0, 0, 0, 0, 0.
00:53
First 8 combinations we can write and x2 is always 0 for this.
01:00
So for any type of input we take 0 or 1, x2 will always be 0.
01:11
So after that we can write like 4 0s and 4 1s.
01:18
Next we can write 2 0, 2 1 and here we can write 0 1 combination 0 1, 0 1, 0 1.
01:29
So for the similar type we can write for x2 as 1.
01:34
X2 as 1 we can write all 8 combinations 1, 2, 3, 4, 5, 6, 7, 8.
01:44
Like this here we have to write 4 0s followed by 4 1s.
01:49
Here as it is 2 0s, 2 1s.
01:54
Again 2 0s, 2 1s.
01:58
And here it is 0 1, 0 1 combination.
02:00
So this is the input for x2 as stock as 0.
02:08
We can write the input function and output function at each value also.
02:18
So here it is an exergete, here it is also exergete, here it is a notget, as we can see.
02:31
Here we can put another exergete, here another exergete and the input is another exergete...