We discussed the Programmable Logic Array, shown above, for representing an arbitrary logic truth table. Fill in the following table with the $16$ bits of your numbers $b1$ and $b5.$ Then use the labels to set the connections labeled in the diagram, $0$ meaning a connection in the first junction with that label and $1$ meaning a connection in the second:

$\backslash$table$[[0,1,2,3,4,5,6,7,8,9,A,B,C,0,E,F$

Please explain to me how we find which input is connected to which output and how we find the output O$1$ and O$2$ truth table and how we find the boolean experession $.$