How can I prove this using a Combinatorial Proof? Can someone explain this to me? How can I approach this?
Let $k \geq 1$ be an integer and consider a sequence 
$n_1,n_2,\ldots,n_k$ of positive integers. Use a combinatorial proof 
to show that. 
$$
 {{n_1} \choose 2} + {{n_2} \choose 2} + \cdots + {{n_k} \choose 2}  
         \leq 
   {{n_1 + n_2 + \cdots + n_k} \choose 2}$$
Consider the complete graph on $n_i$ vertices. How many edges does this graph have?  
 A: Elaborating on the hint, consider a graph formed by the disjoint union of complete graphs of sizes $n_1,n_2,n_3,\dots,n_k$
It will look something like this:

How many edges appear in the graph made from the disjoint union of complete graphs of size $n_1,n_2,\dots,n_k$?
If you are unable to immediately answer that, consider reading this related question.
What does the right side of the inequality count and how does that relate to our scenario here when considering graphs?

 The LHS, $\binom{n_1}{2}+\binom{n_2}{2}+\dots+\binom{n_k}{2}$, is the number of edges in a graph on $n_1+n_2+\dots+n_k$ vertices made up of the disjoint union of complete graphs of sizes $n_1,n_2,\dots,n_k$ respectively.  The RHS, $\binom{n_1+n_2+\dots+n_k}{2}$, is the largest number of edges in a graph on $n_1+n_2+\dots+n_k$ vertices and is in particular greater than or equal to the number of edges in the graph described in the first sentence.  Q.E.D.

A: This should hopefully mostly be a combinatorial proof: the $LHS$ of the equality is the same as (let's call it $S_{left})$:
$$\frac{n_1!}{2!(n_1-2)!} + \frac{n_2!}{2!(n_2-2)!} + \frac{n_3!}{2!(n_3-2)!} + \ ... \ + \frac{n_k!}{2!(n_k-2)!} = S_{left}$$
$$\frac{n_1!}{(n_1-2)!} + \frac{n_2!}{(n_2-2)!} + \frac{n_3!}{(n_3-2)!} + \ ... \ + \frac{n_k!}{(n_k-2)!} = 2S_{left} \tag{1}$$
We know that $\frac{n!}{(n-k)!} = n(n-1)(n-2)...(n-(k-1))$. E.g. $\frac{10!}{(10-2)!} = \frac{10(9)(8)...(2)(1)}{8(7)(6)...(2)(1)}$ will just become $10(9)$ because everything else cancels out. Use this fact for $(1)$:
$$n_1(n_1-1) + n_2(n_2-1) + n_3(n_3-1) + \ ... \ + n_k(n_k-1) = 2S_{left} $$
$$n_1^2 + n_2^2 + n_3^2 + \ ... \ + n_k^2 - (n_1 + n_2 + n_3 + \ ... \ + n_k) = 2S_{left} \tag{2}$$
Now let's move on to the $RHS$, let's call it $S_{right}$:
$$\frac{(n_1 + n_2 + n_3 + \ ... \ + n_k)!}{2!(n_1 + n_2 + n_3 + \ ... \ + n_k - 2)!} = S_{right}$$
$$\frac{(n_1 + n_2 + n_3 + \ ... \ + n_k)!}{(n_1 + n_2 + n_3 + \ ... \ + n_k - 2)!} = 2S_{right} \tag{3}$$
What is $n_1 + n_2 + n_3 + \ ... \ + n_k$? Well it's just a sum of an arithmetic series so it's equal to $\frac{k(n_1+n_k)}{2}$, use that for $(3)$ (we will use it later for $(2)$ as well):
$$\frac{\Big(\frac{k(n_1+n_k)}{2}\Big)!}{\Big(\frac{k(n_1+n_k)}{2} - 2\Big)!} = 2S_{right} \tag{4} $$
Using the same logic here as we did for terms in $(1)$, we can see that $(4)$ is just the sum for $k$ terms times the sum for $k-1$ terms (in the same way that a term in $(1)$ was $n(n-1)$). Change $(4)$ to:
$$\Big(\frac{k(n_1+n_k)}{2}\Big)^2 - \frac{k(n_1+n_k)}{2} = 2S_{right} \tag{5}$$
Use the definition of an arithmetic series on $(2)$ and then compare to $(5)$:
$$n_1^2 + n_2^2 + n_3^2 + \ ... \ + n_k^2 - \frac{k(n_1+n_k)}{2} = 2S_{left} \tag{6} $$
$$\Big(\frac{k(n_1+n_k)}{2}\Big)^2 - \frac{k(n_1+n_k)}{2} = 2S_{right} \tag{7}$$
Use your equality to set $$2S_{left} \le 2S_{right} \tag{8}$$ $S_{left} \le S_{right}$ is the same as $(8)$ so it's valid for our comparison. Then use $(6)$ and $(7)$ in the equality: $$ n_1^2 + n_2^2 + n_3^2 + \ ... \ + n_k^2 - \frac{k(n_1+n_k)}{2}\le \Big(\frac{k(n_1+n_k)}{2}\Big)^2 - \frac{k(n_1+n_k)}{2}$$
$$ n_1^2 + n_2^2 + n_3^2 + \ ... \ + n_k^2\le \Big(\frac{k(n_1+n_k)}{2}\Big)^2 $$
Note that $\Big(\frac{k(n_1+n_k)}{2}\Big)^2 = \sum_{i=1}^{k} n_i^3$, and $n_1^2 + n_2^2 + n_3^2 + \ ... \ + n_k^2 = \sum_{i=1}^{k} n_i^2$. 
So obviously for $k \ge 1$ and positive $n_i$ (for negative $n_i$ this is not true because the cubic series will become negative):
$$ \sum_{i=1}^{k} n_i^2 \le \sum_{i=1}^{k} n_i^3$$
Which completes the proof for the first question. 
Regarding the second question: in a graph with $n$ vertices, the first vertex has $n-1$ vertices to draw edges to, the second vertex has $n-2$ vertices to draw edges to etc. Maybe you can figure it out by this? Alternatively, how many combinations of $2$ vertices connected together can a graph with $n$ vertices have? Where order doesn't matter because $v_1 \leftrightarrow  v_2$ is the same as $v_2 \leftrightarrow  v_1$.
