$1-$ Use Karnaugh Maps to minimize the following Boolean functions:

a$.,F=a(b+c)(d^{\text{'}})+a{c}^{\text{'}}(b+d)$

b$.F=a^{\text{'}}b(c+d^{\text{'}})+a(b^{\text{'}}+c)+a(b+d)c$

c$.F(a,b,c)=a^{\text{'}}bc+ab$

d$.F(a,b,c)=ab+ac+a{b}^{\text{'}}{c}^{\text{'}}+c^{\text{'}}$