Use the Chinese remiander theorem, find all integers x such that:

x = 1(mod5)

x = 2(mod7)

x = 3(mod9)

x = 4(mod11)

Note: You will have to show how you get all values for each variable. Show all steps.