we have 1 to 3 cluster [0,1,2]
Array Indexs (server) are corresponding to cluster
for example
[0,1,1,2,0,1]
server 0 -> cluster 0
server 1 -> cluster 1
server 2 -> cluster 1
server 3 -> cluster 2
server 4 -> cluster 0
server 5 -> cluster 1
constraints:
if servers from same cluster has communication cost is zero, otherwise |i-j|

Solve :
server 0 -> server 4 = communication cost is zero
server 2 -> server 3 = communication cost is |2-3| is 1

Tricky Part is
server 1 -> server 3 = 0+|2-3| = 1
we have find a minimum communication path like
server 1 -> server 2 which has communication cost is zero (both are belongs to same cluster), server 2 -> server 3 communication cost is 1.

Given:
Input
Server as a array.
Query [0,1] server 0 -> Server 1, find minimum cost path