How many steps does divide and conquer techniques need?

a$.$

Only one step that breaks the problem into several sub$-$problems $($Divide$).$

b$.$

Three steps which are Divide, Conquer, and Combine.

c$.$

Two steps which are divide and conquer.

d$.$

Only one step that solve sub$-$problems recursively $($Conquer$).$