Match the term to the statement that best describes it

Question $1$ options:

a technique designed for for finding an approximate solution to a problem when classic methods fail to find any exact solution or are too slow

a sequence of computational steps that transform the input into the output.

an approach to solving a problem that makes decisions based on what looks good at the time without considering related subproblems

a formula that describes the running time of a recursive algorithm

an approach that breaks a problem into several smaller subproblems similar to the original, solves the subproblems, then combines the solutions to create a solution to the original problem

$1.$

algorithm

$2.$

heuristic

$3.$

greedy algorithm

$4.$

recurrence equation

$5.$

divide$-$and$-$conquer