LR(1) parser and LR(1) items

Question

E-> E + T |T

T-> T*F|F

T->(E) | T-F

F->id

If LR(1) parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item T → .T * F in the initial state ________.

Comments

Could anyone please help...I am facing problem in finding the lookaheads.

---

it should be {-,$}.

---

{*,+,-,$} is the answer given. Help.

---

CAN you show how you draw  1st state then it will be possible , or show work how you get look ahed,

answer is {*,+,-,$}