Can someone help?

Perform two-level logic size optimization for F(a,b,c,d)=abc+abcd+abd using a k-map. Write the final function two ways: sum of minterms and minimal SOP. Perform two-level logic size optimization for F(a,b,c,d)=abcd+abcd, assuming a and b can never both be 1 at the same time and that c and d can never both be 1 at the same time. Treat all of these situations as don't cares. Write the final function in minimal SOP form