Are all problems in NP which are not P NP-complete?

1. Are all problems in NP which are not P NP-complete? To make myself more clear, is NP-P=NPC? If not, can you give an example of an NP problem that is neither P nor NP-complete?

2. Are all NP-complete problems NP-hard?

Thank you very much in advance.