You are given an integer array, cost, where cost[i] represents the cost of stepping onto the $i^{th}$ stair. After paying the cost of the stair you land on, you may climb either one or two steps forward. You may begin your climb from step $0$ or step $1$ without incurring any initial cost.

Return the minimum total cost required to reach the position just beyond the last stair (the “top”).

Constraints:

• $2 \leq$ cost.length ...