In Last Passage Percolation(LPP) we assign i.i.d Exponential weights on the lattice points of the first quadrant of $\mathbb{Z}^2$. We then look for the up-right path going from $(0,0)$ to $(n,n)$ that collects the most weights along the way. One is then often interested in questions regarding (1) the total weight collected along the maximal path, and (2) the behavior of the maximal path. It is known that this path's fluctuations around the diagonal is of order $n^{2/3}$. The proof, however, is only given in the context of integrable probability theory where one relies on some algebraic properties satisfied by the Exponential Distribution. We give a probabilistic proof for this phenomenon where the main novelty is the probabilistic proof for the lower bound. Joint work with Marton Balazs and Timo Seppalainen