00:16
Here, um, alright, sorry about that.
00:17
My pen was not working.
00:19
But here our, um, given function i of a, b, c, d is, um, in sum of mini -terms form.
00:30
Our mini -terms are 0, 1, 2, all the way up to 10.
00:34
So now we want to write down the binary, um, representations of each, um, mini -term.
00:40
We know that 0 is equal to 000, 1 is equal to 0001, 2 is equal to 0010, 3 is equal to 0011, 4 is equal to 0100, 5 is equal to 0101, 6 is equal to 0110, 7 is 0111, 8 is 1000, 9 is 1001, and 10 is 1010.
01:20
Now we can write down the boolean expression for each mini -term.
01:24
For our mini -term 0, it is going to be a, b, c, d overline.
01:31
For our, um, mini -term 1, it is going to be overline a, overline b, um, overline c, and then we're going to have d.
01:48
For our number 2, we are going to have overline a, overline b, c, overline d.
01:58
For number 3, we're going to have overline a, b, c, d...