Answer:
See below
Explanation:
we would like to prove the following question:

In order to do so, recall binomial theorem:

where:
- n refers to the degree of a binomial
- C(n,k) is the coefficient of the each term
Considering the given problem,if we assume a and b are 1 and 3 respectively then it can be proved easily so let's try it!

remember that,any power to 1 always yields 1 therefore we can drop
so, we acquire:

simplify right hand side:

hence we are done!
note:
is also written as
