Correct option is B
Given:
We are asked to determine the minimum number of colours required to colour the states in the given map such that no two adjacent states share the same colour.
Concept:
This is a classic Graph Coloring problem from Discrete Mathematics, where:
Each state is treated as a node (vertex) in a graph
An edge connects two nodes if the corresponding states share a border
The Four Color Theorem states:
"Any map in a plane can be colored using no more than four colors, such that no two adjacent regions share the same color."
Observation from the Image:
By inspecting the map (South-Eastern states of India), we see part of:
Andhra Pradesh
Telangana
Odisha
Chhattisgarh
Maharashtra
Karnataka
Tamil Nadu
These states form a connected region, and some of them share boundaries with more than two others, making 3 or more colours necessary.
By properly coloring the map and checking adjacency, we can manage with just 4 colours.
Final Answer:
S. Ans. (4)
