Using Boolean algebra reduce the following expression which is in POS form (product of sum) to a minima SOP form (sum of the products)show all your steps in getting the final results. (Note that the symbol represents inversion operation).

F( a, b , c , d ) = [( a + b + d) . (c + d) . (a+ c+ d). (a + b + d)]