Computer Science Write a regular expression that matches a normalized 32-bit binary IEEE 754 FP number and has no leading or trailing zeros. As a reminder, the leading 1 before the decimal point is...

Extracted text: Computer Science Write a regular expression that matches a normalized 32-bit binary IEEE 754 FP number and has no leading or trailing zeros. As a reminder, the leading 1 before the decimal point is implicit, so your regular expression should allow up to 32 bits after the decimal point. Valid: 0.0, 1.0, 0.1, 1.001100101 Invalid: 00.0, 01.01, 10.11110, 1.0000000000000010