Data Sufficiency - Pilots being able to meet

[cyber_office]

Hi,

I found the following question in a Math test on mbajunnction.com. It is question #9.

They state the answer is E. Can someone please explain why we can't definitely use both statements to definitely produce a "No" answer?

Thanks.

A, B, C, D, and E are airline pilots with very busy travel schedules. Given that D is able to meet at any time that B cannot meet, do the schedules of A, B, C, D, and E allow three of these five individuals to meet together for two uninterrupted hours?
(1) Pilots A and C, who cannot meet together, are not able to end any meeting during the AM hours of any weekday.
(2) Pilots B and E, who can never meet for longer than 2 uninterrupted hours, are only available
to meet for two straight hours starting at 10:30 PM on any weekday and not ending during the AM
hours of any weekend day.

[Ben Ku]

I think probably the easiest way to look at it is that Statement 1 tells us when A and C cannot meet, but doesn't tell us when they can meet. Statement 2 tells us when B and E CAN meet, but doesn't tell us when they cannot meet. There are also ambiguities in the statements. For example, can A and C meet on the weekends? We don't have any information about that.

The question asks for when three of the pilots CAN meet, and we don't have enough information to determine that.

Hope that helps.