Given the following grammar, build a table, including the content

of a stack and input, the actions a shift$-$reduce parser might take in

parsing the input id$1*$id$2.$

E $->$ E$+$T $|$ T

T $->$ T$*$F $|$ F

F $->($E$)|$ id