$"($a$)$ Consider the following regular expression for $$oating$-$ literals in the Low$-$Level Virtual Machine $($LLVM$)$ language. $[12]$

$(-?[0-9]+\backslash .[0-9]+([$eE$][-+][0-9]+)?)|(0$xK$?[0-9$A$-$Fa$-$f$]+)$

Give three di$$erent input strings that match this regular expression. Your strings must match the regular expression in di$$erent ways, i$.$e$.,$ by using di$$erent alternatives or options. For the purposes of this question, choosing another character in a character class does not count as a di$$erence$,$ nor does repeating a repeat QK$10$ ed construct a di$$erent number of times."