Before revision:  We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide.
After revision:  We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set coincides with the cardinality of a maximum witness set coincide.