33.
Which approach is based on computing the distance between each pair of distinct points and finding a pair with the smallest distance?

34.
Consider the following algorithm to find the solution of the activity selection problem. Which of the following option is best suited to fill the blank?
Sort the given activity List 
display the first activity 
set i = 1
for j = 1 to n-1 do
  if begin time of activity[j] >= completion of activity[i] then
      ___________
      i = j