Can someone please explain in detail. Please note they are asking different questions.

Consider the following Boolean function, shown as a truth table 0 0 1 O 0 1 10 How many gates (logical operations) are required to implement this function in POS form, assuming we assign one gate per logical operaion and we don't perform any type of minimization or transformations from its cannonical POS form? Select one: a. 8 b. 4 c. 6 d. 5