This question using the combinations concept, as the order in which the canned goods are displayed is not important. Thus, using the combinations formula, we get 8 ways, which are:
- 555,mega, young`s town,master,saba,blue bay,and century
- ligo,555,mega, young`s town,master,saba,blue bay
- ligo, mega, young`s town,master,saba,blue bay,and century
- ligo, 555, young's town, master,saba,blue bay,and century
- ligo,555,mega, master, saba, blue bay,and century
- ligo,555,mega, young`s town,saba,blue bay,and century
- ligo,555,mega, young`s town,master,blue bay,and century
- ligo,555,mega, young`s town,master,saba, and century.
Combinations formula:
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by the following formula.
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
In this question:
7 from a set of 8, so:
[tex]C_{8,7} = \frac{8!}{7!1!} = 8[/tex]
8 possible ways, in which each way we remove one of them, in the list given above.
A similar problem is found at https://brainly.com/question/23302762
