Sum of Product is the abbreviated form of SOP. In the given function F(A, B, C) = AB+B(A+C), the minterms are AB and B(A+C). The minterm evaluates to 1 if and only if the values of the variables are set according to the corresponding row of the table. 1. Draw the truth table. It uses minterms. Truthtable:Final answer. To grasp this concept fully, Table 1. 17. You'll get a detailed solution from a subject matter expert that helps you learn core concepts. My method of finding them, however, is wrong, because the minterms are actually 0,3,5, and 7. Sum of Minterms -- Sum of Products (SOP) Product of Maxterms - Product of Sums (POS) Explain Minterms. The standard way to represent a minterm is as a product (i. Find the compact canonical sum of minterms. Electrical Engineering questions and answers. (e) Using Boolean algebra, derive a simplified sum of products expression. 382370. Learn how to map minterms and maxterms for logic reduction problems using Karnaugh maps and Product-Of-Sums expressions. Also, it appears the first row is starting from 0, not 1?The Boolean equation description of unsimplified logic, is replaced by a list of maxterms. Maxterms and product-of-sums is another one. A Karnaugh map (K-map) is an abstract form of ____________ diagram organized as a matrix of squares. Express the following Boolean… | bartleby. Observe the table, if the minterm is covered by only one prime implicant then it is an essential to prime implicant. Answer to Solved Express the following function as a sum of mintermsAdvanced Math. For instance, if you have minterms 1 (001), 3 (011), 5 (101), and 6 (110) in a three-variable system, the SOP Form would be A'B'C. F(x,y,z) = xy'z + xy + yz Is the given equation in the canonical sum of minterms form? If not, convert it into this form. Recall that an implicant is a product term in the sum of products representation of a Boolean function. This set of Digital Electronics/Circuits Multiple Choice Questions & Answers (MCQs) focuses on “Karnaugh Map”. (a) (a + b + c) (a'b' + c) (b) h'bc + abc' + abc + a'bc' (c) (a + c) (a + b' + c') (d. Though, we do have a Sum-Of-Products result from the minterms. Write a function f(x) to represent the cost of water as a function of x, amount used. 0000 0. What if instead of representing truth tables, we arranged in a grid format. [c] Write the short form Sum of Products (SOP) expression (list minterms). Step 4. Q. , F = 1 when. b) Find the minimal sum of products expression. Identifying the Minterms from the K-map is equivalent to reading equations in Sum-of-Minterms or Sum-of-Products (SOP) form, directly from the truth table. This problem has been solved! You'll get a detailed solution from a subject matter expert that helps you learn core concepts. Show transcribed image text. The fundamental products or minterms are listed below: Inputs Fundamental products or A B minterms 0 0 m0 = A’ . The following questions refer to the Truth Table below Q7. B (A,D,W)=A′D′W+AA′D′W+AD′W′+ADW+ADWB. o Example, where n=3 and the variables are x, y and z:. Set the delay of all gates to be 2 ns. Simplify the given function using K-Map. These are used in POS. b. Previous question Next question. (e) Using Boolean algebra, derive a simplified product of sums expression. Solution: F = x + y z = x + (y z) AND (multiply) has a higher precedence than OR (add) = x(y+y')(z+z') + (x+x')yz expand 1st term by ANDing it with (y + y’)(z + z’), and 2nd term with (x + x’) A minterm is an expression regrouping the Boolean variables, complemented or not (a or not (a)), linked by logical ANDs and with a value of 1. a) extbf{a)} a) F. Computer Science. Express the complement of the following functions in sum-of-minterms form: a) F(A, B, C, D) =E(2,4, 7, 10, 12, 14). Step2: Add (or take binary OR) all the minterms in. Maxterm. Using the minterms for which the function is equal to 1, the function can be written explicitly as follows:Minterms. A function that defines the solution to a problem can be expressed as a sum of minterms (SoM) in which each of the minterms evaluates to. Develop a truth table for a 1-bit full subtractor that has a borrow input ºn and input * and, and produces a difference, d, and a borrow output, Pout. Show an algebraic expression in sum of minterms form for both out and d, respectively. Construct the truth table of the function, but grouping the n-1 select input variables together (e. given a truth table, find a logic circuit able to reproduce this truth table. Question: Q7 4 Points The following questions refer to the Truth Table below Q7. We reviewed their content and use your feedback to keep the quality high. So, SOP is defined as Sum of Its Min Terms or the other name is Canonical Disjunctive Normal Form. B. This is certainly a compact means of describing a list of minterms or cells in a K-map. (30 points) a. Electrical Engineering questions and answers. For example: F = m (2. The numbers indicate cell location, or address, within a Karnaugh map as shown below right. Jump to level 1 2 Consider a function with three variables: a, b, c. A Product-OF-Sums solution is completed in the usual manner. Example if we have two boolean variables X and Y then X + (~Y) is a maxterm we can express complement ~Y as Y’ so, the above maxterm can be expressed as X + Y’ So, if we have two variables then the maxterm will consists of sum of both the variables. 2. The numbers indicate cell location, or address, within a Karnaugh map as shown below right. 18 (5 points) In Figure P2. 822 # 11Page: 1 ECE-223, Solutions for Assignment #3 Chapter 3, Digital Design, M. Select the a in the identity property a *15 a, so that a 1-a. You'll get a detailed solution from a subject matter expert that helps you learn core concepts. The boolean algebra calculator is an expression simplifier for simplifying algebraic expressions. 2. The Boolean expression, containing only the sum of minterms, is called Canonical Sum- of –Product Form of an expression. I am struggling to convert the sum of maxterms: ((¬b ∧ ¬d) ∨ ((b ∧ (¬c ∧ d)) ∨ (¬a ∧ (b ∧ d)))) into a product of minterms. ∗ (b+cd) (c+bd) 2. We count the number of “successes” corresponding to each minterm by using the MATLAB function sum, which gives the sum of each column. As discussed in the “Representation of Boolean Functions” every boolean function can be expressed as a sum of minterms or a product of maxterms. 0, 1 and 0. • product-of-maxterms • Expand the Boolean function into a. ) a. Solution for Express the following function as a sum of minterms and as a product of maxterms: F(A, B,C, D) = B'D + A'D + BDQuestion: Given the following Decoder circuit, و B F و ل و و ل لنا -3 از له دام & A د لما Provide the sum of Minterms for g(a, b, c, d). This video contains the description about example problem on how to convert the given boolean expression in SOP form. Convert the Boolean function F = x + y z into a sum of minterms by using a truth table. Maxterm. 2. a) Venn Diagram. Canonical Sum or Sum of Minterms (SoM) a sum of products in which each product term is a minterm. (MK 2-20) Simplify the following Boolean functions by finding all prime implicants and essential prime implicants and applying the selection rule: Engineering Computer Science Example 3. 0 1 1 0 0 10001 1011 1 1 1 0 1 1 1111 0Canonical Forms: Product of Sums with Two Variables Showing Maxterms Maxterm A B Result M 0 0 0 r 0 M 1 0 1 r 1 M 2 1 0 r 2 M 3 1 1 r 3 The maxterm for a row is the OR of each variable –uncomplemented if it is a 0 and complemented if it is a 1. Electrical Engineering. View the full answer. Table 1: Truth table for the NAND circuit 1. , logical-AND) of all of the signals, using the complement of any signal that needs to be False for that combination of inputs. 2. Minterm can be understood as a product of Boolean variables (in normal form or complemented form). Then make sure that every term contains each of a, b, and c by using the fact that x + x ′ = 1. Sorted by: 2. • They are marked with an ´ in the K-map. Example lets say, we have a boolean function F defined on two variables A and B. 4000 The number of minterms is 8 The number of available minterms is 2 Available minterm probabilities are in vector pma To view available minterm probabilities, call for PMA DV = [DV; Ac&B&C; Ac&B]; % Modified data. In POS representation, a product of maxterm gives the expression. Try focusing on one step at a time. (f) Draw the AND-OR circuit for the expression in part (c). ABC + A̅B̅C 2. This problem has been solved! You'll get a detailed solution from a subject matter expert that helps you learn core concepts. In Boolean logic, each minterm would have had just two inputs, but here, we added a third input to each, a constant indicating the value of. See Answer See Answer See Answer done loading Final answer. Two dual canonical forms of any Boolean function are a "sum of minterms" and a "product of maxterms. 2. ) Convert the following Boolean function from a sum-of-minterms form, to a product-of-sums form: F (w,x,y,z) = ∑(0,1,2,5,8,10,13) 2. egin {tabular} {|c|c|c|} hlinex & y & f (x,y) hline 0 & 0 & 1. In Product of Sums (what you call ORs) all the maxterms must be true for the expression to be true. Convert 𝐹 to canonical sum-of-minterms form. 4. Explanation: The only equation in sum-of-minterms form is d. Cox – Spring 2010 The University Of Alabama in HuntPetrick's Method is used for determining minimum sum-of-product (SOP) solutions in a given prime implicants chart. In this lesson, we will look at one of two "standard forms" of boolean functions. b) (cd + b'c + bd' ) (b + d) Expanding it we get : =>. The output result of the minterm function is 1. So a 4-variable k-map will have 16. Now apply DeMorgan's: Not Not f f = Not (AB¯¯¯¯C Or AB¯¯¯¯C¯¯¯¯) = (A¯¯¯¯ Or B Or C¯¯¯¯) And (A¯¯¯¯ Or B Or C) Your given answer for "product of maxterms. Each of these three product statements is a minterm—a term that is True (1) for exactly one combination of inputs. a) The Boolean function E = F 1 + F 2 containsthe sum of minterms of F 1 and F 2. Applies commutative law, distributive law, dominant (null, annulment) law, identity law, negation law, double negation (involution) law, idempotent law, complement law, absorption law, redundancy law, de. The function2 has terms called a product term which may have one or more literal. maxterm(最大項),standard sum(標準和項):將n個輸入變數用or運算結合,若輸入變數的值為1,則變數加上反相符號 且(minterms)'=maxterms 最小項表示法,也稱SOP(sum-of-minterms,sum-of-products,最小項之和),積之和型式 將所有輸出為1的最小項用 or連接Using variable values, we can write the minterms as: If the variable value is 1, we will take the variable without its complement. (MK 2-32) Convert the AND/OR/NOT logic diagram in Figure 2-46 to a) a NAND logic diagram and b) a NOR logic diagram a) a NAND logic diagram b) a NOR logic diagramEngineering Computer Science Example 3. Simplify the following Boolean expressions to a minimum number of literals. 2. Logic circuit design | minterm and Maxterm and SOP and POS الحصول علي محتويات الفيديو 00:00 - البداية00:08 - minterm and. Since any boolean function can be expressed as a sum of minterms, a decoder that can generate these minterms along with external OR gates that form their. DNF and CNF missing law/rule. . Suppose n = 2 (x and y) and, we know ‘0’ represents complements i. Previous question Next question. Sum of minterms formMake a prime implicant table that consists of the prime implicants (obtained minterms) as rows and the given minterms (given in problem) as columns. Question: 1. Learn how to map minterms and maxterms for logic reduction problems using Karnaugh maps and Product-Of-Sums expressions. The sum of all literals, either with complement or without complement, is known as maxterm. The value for all other combinations is 0 0 0. Note: For n-variable logic function there are 2 n minterms and 2 n maxterms. Maxterm can be understood as the sum of Boolean variables (in normal form or complemented form). List the. and that "A compact notation is to write only the numbers of the minterms included in F" which is $\sum (1,2,4,7)$ I don't understand this because the rows in the truth table are interchangeable; 0,0,0,0 could be the last row instead of the first. (f) Draw the AND-OR circuit for the expression in part (c). Any Boolean function can be expressed as the sum (OR) of its 1- min terms. e. Referring to the above figure, Let’s summarize the procedure for writing the Sum-Of-Products reduced Boolean equation from a K-map: Form largest groups of 1s possible covering all minterms. Select the 1 in the Complement property ata': 1, so that ata' - 1 5. List the minterms of E- and F-. The image is how you would map a product term onto minterms in a Karnaugh map. Trending now This is a popular solution! Step by step Solved in 2 steps. 2. (d) Obtain the function F as the sum of. b) Find the minimal sum of products expression. 2 Points. It is represented by m. 4: let F = A'C + A'B + AB'C + BC a) Express it in sum of minterms. CHALLENGE ACTIVITY 6. A sum-of-products form must be a sum of minterms and a minterm must have each variable or its compliment as a factor. 15 Simplify the following Boolean function F, together with the don't care conditions d, and then express the simplified function in sum-of-minterms form: (a) F(x. 3 – Minterms for Three Variables. For each input/output table, give a Boolean expression that is a sum of minterms and is equivalent to the function defined by the table. This page titled 8. Who are the experts? Experts have been vetted by Chegg as specialists in this subject. #Minterms #Maxterms #Representhegivenbo. (b) List the minterms of E and F (e) List the minterms of E+ Fand F. A. For. Chap 4 C-H6. Then for Z it's --1, where the values can be 001, 011, 101, 111. A minterm, denoted as mi, where 0 ≤ i < 2n, is a product (AND) of the n variables in which each variable is complemented if the value assigned to it is 0, and uncomplemented if it is 1. This problem has been solved! You'll get a detailed solution from a subject matter expert that helps you learn core concepts. Then for Z it's --1, where the values can be 001, 011, 101, 111. The following Boolean equations for three variables (n=3) are in SOP form. (c) List the minterms of E + F and E F (d) Express E and F in sum-of-minterms algebraic form. Example of SOP: XY + X’Y’ POS: Product of sums or. Any boolean function can be represented in SOM by following a 2 step approach discussed below. x y z Minterms Notation Consider the function: F = x’yz + xy'z + xyz' + xyz Using the table above, write the function using minterms and sum of minterms form Using the table above, write the inverse of the function using minterms and sum of minterms form. Write it as a product of maxterms. Check out a sample Q&A here. Make rectangular groups. This is an introductory video on K-maps in digital electronics series. • while in Maxterm we look for function where the output results is “0”. To start, each row on the table (P 1. Using DeMorgan’s law, write an expression for the complement of F. Select a property from the right to apply Properties Distributive Identity WX ab+ac = a (b+c) a:1 a (a+b) (a+c) = a+bc a+0 a Commutative Null elements ab ba a:0 0 a+b b+a a+1 1 Complement. 2. Example 6: In this example, we have an expression (¬X → Z) ∧ (Y ↔ X). F(A, B, C, D)= B′ D + A′ D +B D b) Directly. Maxterm from valuesObtain the truth table for the following functions, and express each function in sum-ofminterms and product-of-maxterms form: A. Draw the logic diagram, using the original Boolean expression c. Question: For the input/output table, give a Boolean expression that is a sum of minterms and is equivalent to the function defined by the table. 12. Minterm and sum-of-products is mean to realize that. A minterm, denoted as mi, where 0 ≤ i < 2n, is a product (AND) of the n variables in which each variable is complemented if the value assigned to it is 0, and uncomplemented if it is 1. Step2: Add (or take binary OR) all the minterms in. Sum of Minterms or SOM is an equivalent statement of Sum of Standard products. b) Find the minimal sum of products expression. Identifying the Minterms from the K-map is equivalent to reading equations in Sum-of-Minterms or Sum-of-Products (SOP) form, directly from the truth table. Express the complement of the following functions in sum-of-minterms form: (a) F(A,B,C,D) = (2, 4, 7, 10, 12, 14) (b) F(x, y, z) = T(3, 5, 7) Q2. Full adder: Sum Before Boolean minimization Sum = A'B'Cin + A'BCin' + AB'Cin' + ABCin After Boolean minimization Sum = (A ⊕B) ⊕Cin 10 Full adder: Carry-out Before Boolean minimization Cout = A'BCin + AB'Cin + ABCin' + ABCin After Boolean minimization Cout = BCin + ACin + AB 11 Preview: 2-bit ripple-carry adder A1 B1 Cin Cout Sum 1 A2 B2 Sum. 10, then from the table we get F = 1 for minterms m3, m4, m5, m6, and m7. This problem has been solved! You'll get a detailed solution from a subject matter expert that helps you learn core concepts. DLD 2. The calculator. , logical-AND) of all of the signals, using the complement of any signal that needs to be False for that combination of inputs. Each is worth 3. Go through each of the possible inputs with both circuit outputs on the same waveform and explain how the waveform indicates the equations are the same. Minterms are the product of various distinct literals in which each literal occurs exactly once. The canonical Sum-of-Products (SOP) and Product-of-Sums (POS) forms can be derived directly from the truth table but are (by. . qx3zqy7 Jump to level 1 1 Х у z f (x. 1. As the product of maxterms 6. For minterms/maxterms associated with “don’t care” input combinations, assign output value of 0 or 1 to generate the minimum cost coverQuestion: Express the three terms x, y, and z in the form of minterms and minterm notation. 14) Obtain the truth table of the following functions and express each function in sum of minterms and product of maxterms: a) (xy + z) ( y + xz) b) (A′ + B) (B′+C) c) y′z + wxy′ + wxz′ + w′x′z a) (xy + z) ( y + xz) = xy + yz + xyz + xz =∑(3,5,6,7) = ∏ ( 0 ,1,2,4)4. F(a,b,c) = a + b + c Is the given equation in the canonical sum of minterms form? If not, convert it into this form. 3) Standard. Express the following Boolean function as a sum of minterms. See Answer See Answer See Answer done loadingObtain the truth table for the following functions, and express each function in sum-of- minterms and product-of-maxterms form: (Total: 30 points) (a) F(X, Y, Z) = XY' + X'Y + XZ' + X'z 1. Question: Which of the following statements is most true? A function has multiple sum-of-minterm representations. • Any combinational circuit with n inputs and m. The sum of minterms (SOM) form; The product of maxterms (POM) form; The Sum of Minterms (SOM) or Sum of Products (SOP) form. for C. Design a logic circuit using a minimum number of 3 -to-8 decoders (74LS138) and logic gates that does the following: a. . – A function can be written as a product Canonical Sum or Sum of Minterms (SoM) a sum of products in which each product term is a minterm. (A*-B)+ (-A*B) = XOR. AB̅C + A̅B̅C +. i need help showing wok for these problems . e. Question: Express the following function as a sum of minterms and as a product of maxterms: F(A,B,C,D) = B'D + A'D + BD For example: (1,2,3,4) Sum of Minterms. Minterms and Maxterms are important parts of Boolean algebra. 14 a Show minterms 3 2 1 00111 01000 a. Show a minimum SOP expression (a: 2 terms, 5 literals; b: 1 term, 1 literal). a) Given Function is F (A, B. Question: Identify the Boolean function that is defined by the following input/output table. So how can we show the operation of this “product” function in Boolean Albegra. Describes how to derive the Sum of minterms from a three variable Truth TableIn Sum of Products (what you call ANDs) only one of the minterms must be true for the expression to be true. 20 Express the complement of the following. Question: a) Express the following function as a sum of Minterms,and then represent it in ∑ format –Show your work. This problem has been solved! You'll get a detailed solution from a subject matter expert that helps you learn core concepts. Any Boolean function can be expressed as a sum of its 1-minterms and the inverse of the function can be expressed as a sum of its. Groups must be a power of 2. a) 3 Variables: A (x,y,z)=m3+m4+m6+m7 b) 3 Variables: B (x,y,z)=m0+m2+m4+m5+m6 c) 4. Transcribed Image Text: Write down an expression for F(X,Y,Z) in (a) sum of minterms form and (b) product of maxterms form for the truth table below: 4. The sum of minterms, known as the Sum of Products (SOP) form, is a simplified version of a Boolean function represented as an OR combination of minterms. 17 Obtain the truth table of the following functions, and express each function in sum‐of‐minterms and pr. The answer should list the minterms as m0+m1+m2. It is calculated as the. The truth table for Boolean expression F is as follows: Inputs. It is a product of all variables in a function and that function has the property that it is equal to 1 on exactly one row of the truth table. 2 is the complement of the corresponding minterm A B ¯ C Plotting a maxterm on a Karnaugh map requires further consideration. To understand better about SOP, we need to know about min term. combined all minterms for which the function is equal to 1. Show transcribed image text (a) Construct the truth table. In addition, you must show your work on the paper you submit on eLearning to get credit. A: In the theory of computation the term minterms whose sum defines the Boolean function are those… Q: Problem 1 : Simiplify ik following Boolomm functions. Answer to Solved 2. Answer to Solved 2. [d] Write the short form Product of Sums (POS) expression (list. Show a minimum SOP expression ( a: 2 terms, 5 literals; b: 1 term, 1 literal). Answered: Q2. There are 3 steps to. Table 1. There are 2 steps to solve this one. Show the completed circuit. Each of these three product statements is a minterm—a term that is True (1) for exactly one combination of inputs. Referring to the above figure, Let’s summarize the procedure for writing the Sum-Of-Products reduced Boolean equation from a K-map: Form largest groups of 1s possible covering all minterms. Express 𝐹 using the truth table. (a). Obtain the truth table of the function F = (A+ C)(B + C) and express the function in sum of minterms and product of maxterms. Show an algebraic expression in sum of minterms form. F(x,y,z) = xyz Is the given equation in the canonical sum of minterms form? If not, convert it into this form. The term " Sum of Products " ( SoP or SOP) is widely used for the canonical form that is a disjunction (OR) of minterms. a) 3 Variables: A(x,y,z)=m3+m4+m6+m7 b) 3 Variables: B(x,y,z)=m0+m2+m4+m5+m6 c) 4 Variables: C. Who are the experts? Experts have been vetted by Chegg as specialists in this subject. Show an algebraic expression in sum of minterms form, c. For small expressions, you can write down the truthtable. Be able to use both alphabetic and decimal notation. - (P* (-P+Q))+Q = Modus ponens. (b) List the minterms of E and F . Question: 4. 2. You'll get a detailed solution from a subject matter expert that helps you learn core concepts. Electrical Engineering. I use Morgan and get this: ((¬b ∨ ¬d) ∧ ((b ∨ (¬c ∨ d)) ∧ (¬a ∨ (b ∨ d)))) which doesn't have an equivalent truth table. Step 2. A device used in cases where only 2 people work in a business where A. 0 1 02 03. a the product of maxterms E represents the sum of products(sop) a. This widget allows to get some helpful information about an arbitrary minterm based on its number and amount of logic variables. Show a minimum SOP expression (f. )). Express the following Boolean Function in sum of min-terms F = ABC + BC + ACD F = A B C + B C + A C D My Question: Do we need to solve it like below? F = ABC + BC + ACD F = A B C + B C + A C D F = ABC(D +D′). To understand better about SOP, we need to know about min term. 1 will be used to illustrate Petrick's method. Canonical Sum of Products. by making the n-1 select variables as most significant inputs). So for x'y' there exists two options of 00- where z is 000 and 001. Each of the sum terms in the canonical POS form is called a maxterm. Assume the company has a capacity of 400 hours of processing time available each month and it makes two types of. minterm 0, then minterm 1 etc. 3) appears in both its true and complemented form, and can be eliminated. This problem has been solved! You'll get a detailed solution from a subject matter expert that helps you learn core concepts. Input Variable (A) Input Variable (B) Minterm Minterm notation. . Question: Q3. 2. In Figure P2. A 2-variables function has 2 2 =4 possible maxterms. Once again, the numbers indicate K-map cell address locations. Sum of Products (SOP) Product of Sums (POS) Sum of Products (SOP) A boolean expression consisting purely of Minterms (product terms) is said to be in canonical sum of products form. $\endgroup$ – copper. Show transcribed image text. FIll In the truth table, then enter the Sum-of-minterms and the Product-of-Maxterms. ABC̅ + AB̅C + A̅B̅C̅ 5. First, it is necessary to recognize the min terms that have 1 as the output variable. We form a mintable for three variables. For the input/output table, give a Boolean expression that is a sum of minterms and is equivalent to the function defined by the table. Minterms are single 1s in a map, maxterms are 0s in a map. Note: Type x' for X 366628. Choose n-1 variables to be connected to the mux select lines. B(A,D,W)=A′D′W′+A′D′W+AD′W′+AD′W+ADWB(A,D,W)=A′DW′+A′D′W+ADW′+AD′W+ADWB(A,D,W)=A′DW+A′D′W+ADW′+AD′W′+ADWB(A,D,W)=A′DW′+AD′W+ADW′+AD′W+A′DW Q7. The following questions refer to the Truth Table below. Express the Boolean function F = x + y z as a sum of minterms. Each row of a table defining a Boolean function corresponds to a minterm. For POS put 0’s in blocks of K-map. Generally, Maxterms are represented as complements of Minterms. A*B = A and B. Sum of minterms is unique. This form is obtained by identifying minterms (where output is 1) in a truth table and combining them using the logical OR operator. Meaning of minterm. d. Problem: Find the minterms of the following expression by first plotting each expression on a K-map: a) F(X,Y,Z) = XY + XZ + X’YZ b) F. Example 2. Maxterm of ‘n’ variables is a sum of ‘n’ variables which appear exactly once in True or Complemented form. Minterm is the product of N distinct literals where each literal occurs exactly once. Expert Answer. (d) Derive the product of maxterms expression. The X and Y are the inputs of the boolean function F whose output is true when any one of the inputs is set to true. There are 2 steps to solve this one. Therefore M i = m’ i. Convert to sum-of-minterms form: ac + a'c' Here’s the best way to solve it.