Graph theory Orientable Graphs

Question

I need help doing this question, and I believe a 'standard' solution would require proof by induction. Here is the question: Suppose that n ≥ 3 and a simple graph G has n vertices and at least $\frac{n^2−3n+6}{2}$ edges. Prove that G is orientable.