Question 11
i There are 11 regions in the diagram on the right. Each region
is to be painted with one colour. What is the least number of
= colours needed to paint all the regions so that any two
i / adjacent regions do not share the same colour?
A. 3
sl B. 4
=| GS
iS D. 6
i E. None of the above
. =

is to be painted with one colour. What is the least number of
= colours needed to paint all the regions so that any two
i / adjacent regions do not share the same colour?
A. 3
sl B. 4
=| GS
iS D. 6
i E. None of the above
. =
