Solution:

The distance from any point (x, y, z) to the point (2,-2,3) is

(x, y, z) lies on the plane ,so we have:

Solving for the critical points,

Substituting A) into B),

Therefore, there is one critical point ().

Using the Second Derivative Test,

Therefore, () is a local minimum. The local minimum is the absolute minimum because there must be a point on the plane that is closest to the point (2,-2,3).

So, if then,

Therefore, the shortest distance from the point (2,-2,3) to the plane is

No Maple Code for this problem.