Trick-or-Treat! Halloween Logic Contest!

In honor of Halloween, the first Goddard resident to email RHAD Meredith at mp151@nyu.edu with the correct answers to this logic contest will win a 100g Lindt Excellence Gourmet Dark Chocolate Bar.

A student will go trick-or-treating at six different houses this year. He will go to exactly one house at a time, and he may only visit each house once or else they will recognize his costume and chase him away. Each house is owned by exactly one of six different families- the Adams, the Brooks, the Carletons, the Deacons, the Ewings and the Fords. The student muse visit the houses according to the following conditions:
-The student will visit the Adams' house at some time before he visits the Ewings.
-The student will visit the Ewings's and Ford's houses consecutively, though not necessarily in that order.
-The student will visit the Carleton's house at some time before he visits the Brooks' house.
-The student will visit the Ford's house at some time before he visits the Carleton's house.

1) Which one of the following could be an accurate list of the first three houses which the student visits, listed in order from first to third?
a) the Adams, the Deacons, the Fords
b) the Brooks, the Deacons, the Adams
c) the Deacons, the Carletons, the Adams
d) the Deacons, the Fords, the Adams
e) the Deacons, the Fords, the Ewings

2) If exactly one house is visited between the Deacons and the Brooks, then for how many houses can the order of trick-or-treating be determined?
a) two
b) three
c) four
d) five
e) six

3) The student could visit the Carleton's house
a) first
b) second
c) third
d) fifth
e) sixth

Happy Hauntings!!!