Please do # 4 and 5! Thats what I dont understand. Can you help me? Thanks!!!

Problem 1: Suppose the alphabet given is 10,1). For the languages that are given below construct Deterministic Finite Automata I. L = {w: w begin with a 1 and ends with a 0} 2. L fall strings with exactly three 0's) 4, L = {abwb": w is from {a,b)') 5, L = {all strings with at least one a and exactly two b's)