Homework 1: Truth Table Practice Remove any instructions in italics before converting to PDF and submitting. Create an equivalent Boolean Algebra expression for a circuit with 2 inputs A and B, whose output Q is True when both inputs are the same. Truth Table 1 - Fill in the table below with your inputs and output. - Use 1/0, T/F, or True/False (listed in order of instructor preference). - Rows should be ordered in proper binary sequence for the inputs, from lowest to highest (0,0 to 1,1) - Fill in the subexpression for each row where Q is 1,T, or True, using either the proper symbols (AND) and ( NOT), or for simpler typing, (caret) and (tilde). Boolean Algebra Expression 1 - Create your full Boolean Algebra expression by combining the subexpressions from the rows of your Truth Table in which Q is 1,T, or True, using either the proper symbol v (OR), or for simpler typing, v (the letter v ). - [Optional] Simplify your statement by application of Boolean laws/properties. You should show your steps, and only use ,V,( or ,v,) you are not allowed to use symbols that were not defined in the module (e.g., XOR, NAND, NOR)