Select all the statements below which are TRUE:
Change making problem with the system of coins \{1, 4, 16, 64, 256\} is solved optimally using
Greedy.
Boolean Linear Programming is NP-hard.
Let X = ALGO and Y = LEGO. Then \{\(1,1\), \(2,1\), \(3,3\), \(4,4\)\} is a possible alignment of X and
Y.
Default