Answer Happy

Please read the instructions and complete question 1. The course
is in C++.
Task 1 For each Boolean function (Fi) in the truth table below, write the product of sums (POS) and sum of products (SOP) representations of the function. 1. A B С F1 F2 F3 F4 F5 1 1 1 1 1 0 1 0 1 1 0 0 1 1 0 1 1 0 1 0 1 1 1 1 1 0 0 1 0 0 1 0 0 1 1 0 1 1 0 1 0 1 0 1 0 0 0 0 0 0 1 1 o 0 1 1 0 0 0 0 0 1 0 0 Represent NOT with / or !. Task 2 2. Create a header file named "Circuits.h" that defines a bool function for each Boolean function from Task 1. Each function must take three bool (boolean) parameters for each input (A, B, C) and its body must consist of only a single return statement that consists of at most 7 rational and logical operators. The equivalent relational or logical operator for each standard Boolean operator is provided in the table below Equivalent Operator && Boolean Operator AND () OR (+) NOT O XOR () 11 ! !=