Question $110$ pts

Select all the statements below which are TRUE:

Let $x=$LEARN and $Y=A\frac{L}{P}$I $N.$ Then $\{(3,1),(4,3),(5,5)\}$ is a possible alignment of $x$ and $Y.$

$0-1$ Integer Linear Programming is NP$-$hard.

Default

Solving the Sequence Alignment problem via divide$-$and$-$conquer has running time $O(m+n).$

Weighted Interval Scheduling can be solved optimally using greedy when all requests have

value $5.$

Change making problem with the system of coins $\{1,6,9,27,81,243\}$ is solved optimally using greedy.