Question

Describe an algorithm whose argument is a collection C={A1, A2, ...,
Am} of sets, each consisting of some of the integers between 1 and n,
and that returns the largest sub-collection of C that is nested. (See
homework assignment 4 for the definition of nested collections.) You
can assume that, given two sets A and B with elements from 1 through
n, it takes O(n) time to find whether ACB or not.​

Answer 1

Answer:

an algorithm whose argument is a collection C={A1, A2, ...,

Am} of sets, each consisting of some of the integers between 1 and n,

and that returns the largest sub-collection of C that is nested. (See

homework assignment 4 for the definition of nested collections.) You

can assume that, given two sets A and B with elements from 1 through

hope it will help you