Proof by induction

So, i know how proof by induction work. Define a base case, assume its always true for arbitrary value k the prove it works with k+1. I'm stuck on this question.
prove by induction that k<2^k.
I get the first step 1<2^1 which is 1<2
I assume k<2^k.
I just cant prove that k+1 < 2^(k+1)

can anyone help?

k + 1 < k + k

How did you work this out? I don't just want the answer, i need to know the process.