Min Cost Climbing Stairs

Question Explain

You are given an integer array `cost` where `cost[i]` is the cost to step on the $i$-th stair. You can either start at index 0 or index 1. Find the minimum cost to reach the top of the floor. Use DP.