$1.(30$ pts$)$ Write a Java program A$1$p$1.$java with a public class A$1$p$1$ and no named packages. The program should take two command line arguments assumed to be integers a and b $($with a less than b$)$ and print the integers a$,$a$+3,$a$+6,$a$+9,...,($up to b$).$ Each line should contain five integers separated by commas with no comma after the last integer on each line $($the last line is allowed to contain less than five integers$).$ Further, if any integer is a multiple of $7,$ it should be printed between a pair of curly braces. Two sample runs look like the following $($Note: in sample runs, blue color means those typed by the user while others are displayed by the program or the command window itself$)$:

$[$kwang@computer$][$~$/$temp$]$$ java A$1$p$1547$

$5,8,11,\{14\},17$

$20,23,26,29,32$

$\{35\},38,41,44,47$

$[$kwang@computer$][$~$/$temp$]$$ java A$1$p$1-359$

$-3,\{0\},3,6,9$

$12,15,18,\{21\},24$

$27,30,33,36,39$

$\{42\},45,48,51,54$

$57$

$2.(30$ pts$)$ Write a C program A$1$p$2.$c that works in the same way as A$1$p$1.$java. Two sample runs look like the following:

$[$kwang@computer$][$~$/$temp$]$$ A$1$p$2547$

$5,8,11,\{14\},17$

$20,23,26,29,32$

$\{35\},38,41,44,47$

$[$kwang@computer$][$~$/$temp$]$$ A$1$p$2-361$

$-3,\{0\},3,6,9$

$12,15,18,\{21\},24$

$27,30,33,36,39$

$\{42\},45,48,51,54$

$57,60$

$3.(40$ pts$)($see TestScanfandCondition.c in Folio if needed$)$ Write a C program A$1$p$3.$c to read from stdin a specified number of lines of input $($each line can be assumed to contain a pair of integers separated by a space$).$ The program should print the product of the two numbers after each line is received. A sample run looks like the following:

$[$kwang@computer$][$~$/$temp$]$$ $./$A$1$p$3$

How many pairs to input? $3$

$12$

The product of $1$ and $2$ is $2.$

$56$

The product of $5$ and $6$ is $30.$

$9-28$

The product of $9$ and $-28$ is $-252.$