Q: There are n white dots and n black dots, equally spaced in a line. We want to each white dot with some black dot in on-to-one fashion with a minimum total length of the wire. (See diagram above). Greedy algo. gives optimal solution for..
A) Only i
B) Only ii
How to approach to such type of questions ?