Answer and explanation:
To convert the Boolean function F = x'y + y'z + xz into standard sum of minterms form, we can use the following steps:
1. Write the Boolean function in canonical sum of products (SOP) form.
2. Identify the minterms that correspond to the 1's in the truth table.
3. Write the Boolean function as a sum of these minterms.
Here are the steps in more detail:
1. Convert the Boolean function F into canonical SOP form by applying De Morgan's law and distributing the negations:
```
F = x'y + y'z + xz
= (x + z')(y + z)(x' + y')
```
2. Identify the minterms that correspond to the 1's in the truth table. In this case, there are three minterms: m(1,2,4) = x'y'z + x'yz' + xyz.
3. Write the Boolean function as a sum of these minterms:
```
F = m(1,2,4)
= x'y'z + x'yz' + xyz
```
Therefore, F = x'y + y'z + xz can be expressed as a sum of minterms as F = x'y'z + x'yz' + xyz.
I hope this helps!