Digital logic

Question 1 Ansever saved Marked out of 1.00 P Flag question Consider the following Boolean function, shown as a truth table: A B C | Y 0 0 10 0 10 1 0 11 0 1 0 0 1 1 0 1 1 1 10 0 How many gates (logical operations) are required to implement this function in SOP form, assuming we assign one gate per logical operaion and we don't perform any type of minimization or transformations from its cannonical SOP form? Select one: b. 9 C. 8 d. 6