You are given an integer array cost where cost[i] is the cost of the ith step on a staircase. Once you pay the cost, you can either climb one or two steps.

a) Dynamic programming approach
b) Greedy algorithm
c) Depth-first search
d) Breadth-first search