b. Describe an efficient method to determine whether or not one d-dimensional box nests inside another. c.

Question:

b. Describe an efficient method to determine whether or not one d-dimensional box nests inside another.
c. Suppose that you are given a set of n d-dimensional boxes {B1, B2,..., Bn}. Describe an efficient algorithm to determine the longest sequence (Bi2, Biz,...Bik) of boxes such that nests within Bij+1for j = 1, 2,..., k - 1. Express the running time of your algorithm in terms of n and d.