Give regular expressions for these languages

. (i) { w | w is a word of the alphabet= {0,1} that represents an integer in a binary form is a multiple of 4}

(ii) { w belongs to {a,b}* | w contains the string ab exactly 2 times bus not at the end }

(iii) { w belongs to {0,1,2}* | w = uxvx, that x belongs to {0,1,2}, u,v belongs to {0,1,2}* and there isn't any string y int the sequence v that x