Create a maths problem and model solution corresponding to the following question: Given the following complete Sum of Products produce a Karnaugh map and find the minimal Sum of Products, then draw the corresponding logic circuit Use 4 boolean values, and label them g, h, i and j. Your problem should make use of at least 7 products, one of which should be ghij. . Ensure the minimal Sum of Products is different to the complete Sum of Products initially provided. You can find similar problems in Tutorials 3 and 4, but must not use any of them in constructing your own.