Let $G$ be a connected graph such that $δ(G)≥k$. Proof there exists a path $P$ of length $k$ such that $G-P$ is connected.
I am not sure how do I actually approach this question. Do I consider contradiction or inductive proof, if so how. Really appreciate it alot