Consider the function $f$:$B^{3}B$ defined by the input$/$output table below.

a$.$ Create a Karnaugh map and use that map to write $f$ as an algebraic expression with fewest terms.

b$.$ Write $f$ as a sum of minterms, then use the laws of Boolean algebra to reduce $f$ to a function with as few terms as possible.

$\backslash$table$[[x,y,z,f(x,y,z)$