For each of the following decision problem¹ P: i. Describe a way to represent the inputs as strings (the alphabet doesn't have to be binary). ii. Describe a regular expression that represents the language L := {w | P(w) = 1} and briefly explain why the regular expression is correct. Note: You don't have to provide the exact regular expression for part (ii). Describing how you would formulate the regular expression is sufficient, given that the exact regular expression could indeed be obtained by following your solution.

Examples of hardware description languages are: VHDL Circuit Design Logic Buddy Verilog QUESTION 21 Convert 672 base 10 (decimal) to base 2 (binary) 1010100011 1010100000 1010100010 1011100010 QUESTION 22 Convert 9A2546EF base 16 (hexadecimal) to base 10 (decimal) 161633390 151533390 161639930 161633930