B$.(12$ points$)$ You will now design an input string that will defuse NukeJr by causing the call to overflow to return to address $0$x$400623$ instead of $40061$d$.$ As described above, your input will consist of single bytes in hex, written using one or two hex digits, typed in ascii characters. These inputs will be interpreted as hex integers and then converted to chars. For the purposes of this question, we will call inputs these hex ints. Your hex ints will be separated from each other by spaces, and each in turn will be scanned by scanf and assigned to val. The next questions will refer to the hex ints in your solution input string. Please make your solution input string as short as it can possibly be$.$ Note: Your solution can trash the contents of $\%$rbx stored on the stack. Once you have designed your solution input, proceed! i$.(2)$ How many hex ints $($each separated by spaces$)$ are in your solution input string? Remember your input string should be as short as possible to accomplish the described defusing $$attack$.$ ii$.(2)$ How many hex ints in your solution input string could be anything? In other words, how many of your hex ints could be changed without impacting the success of the defusing $$attack$$ on the NukeJr program? We will call these filler hex ints. iii. $(2)$ How many hex ints in your solution input string must be precisely correct for NukeJr to be defused? We will call these precise hex ints iv$.(2)$ Which comes first in your solution input string, the filler hex ints or the precise hex ints? v$.(4)$ Give the precise hex ints exactly as they would be included in your input string. To ensure proper grading: $1)$ don$$t include a leading $0$x$,2)$ include only a single space between consecutive hex ints, $3)$ use only uppercase letters in your hex, and $4)$ don$$t include any leading $0$s in your hex int