incompleteness of first-order logic

1.
Give a concrete counterexample to:
For any theory T and sentence p, T |/- p => T |- not p.

2.
M is a model. Let Th M = {p : M |= p}.
Show that Th M is a complete theory, that is to say, Th M |/= p => Th M
|= not p.

.