9. Suppose that M(x are computable partial functions. Show that the predicate N(y) given by N(y) M(gi(y),.. , gn (y) is partially decidable. (We take this to mean that N(y) does not hold if any one of gi(y),..., gn (y) is undefined.)