Answer:
Choice D. There is exactly one plane that contains the three ducks:
,
, and
.
Explanation:
The three points
,
, and
are distinct since each of the three points represents a different duck.
There's only one line through two distinct points in a 2D cartesian plane.
Likewise, given two distinct points (
and
) in a 3D space, there would be only one line two the two points.
Assume that plane
represents the plane that contains the surface of the lake.
A line is in a plane if and only if all points on that line are in the said plane.
Point
is on the line that contains
and
. However, since point
denotes the flying duck, this point would not be in
(the plane that contains the surface of the lake.)
Hence, the line that contains
and
would not be in plane
.
Given three distinct points in a 3D space, there would be exactly one plane that contains the three points.
Hence, three points in a 3D space would not be non-coplanar.
In this question, point
,
, and
are all distinct. Hence, there would be exactly one plane that contains these three points.