To define two sets, set A and set B, first conduct an online browsing trial, in which you spend 10-20 minutes looking at different websites, such as for national news, social media, sports, hobbies, recipes, etc. Let set A represent exactly three distinct company names from any online advertisements you saw during your browsing trial. Let set B represent at least three distinct company names for any online retailers you have purchased from in the past year.

To prepare to use your algorithm, answer the following questions:

How many elements are in set A? This is what you will set as m = ___.

How many elements are in set B? This is what you will set as n = ___.

What are your first and last elements of A? Show these as a[1] = ____ and a[m] = ___.*

What are your first and last elements of B? Show these as b[1] = ____ and b[n] = ___.*

*Note: Recognize that there are other elements you will cycle through as you trace the algorithm. While you are not required to list all elements in this form, you will need to use them, in addition to the first and last elements.

Using your sets A and B along with what you just outlined to prepare, determine an algorithm that you can use to see whether A ⊆ B.

State the algorithm that you would use to compare these sets.

Based on your algorithm, did you find that A ⊆ B or that A ⊈ B? Explain. If A ⊈ B, how are they related (e.g., disjoint, intersecting)?

**Complete Answer:**