I need to give a Finite Automata the following language over the alpahabet 0 & 1: all strings ending in 00?

Its this homework I'm stuck on about Automata Theory. I have to give a finite automata to accept the following language over the alphabet {0,1}:


a) the ste of all strings ending in 00


b) the set of all strings with three consecutive 0's


c)the set of all strings with 011 as sub-strings





All I want to know is how to start constructing the diagram and the table! Please, anyone! I need your help! please!!!!

I need to give a Finite Automata the following language over the alpahabet 0 %26amp; 1: all strings ending in 00?
May be you can search at homework help website like http://homeworkhelp.co.in/ .