Option (B) is correct.
Explanation: A plan is decided by the set of routers given to each server. Server s1 may get
{t1},{t2},{t1,t2}
The empty set is not allowed, because s1 must be in the domain. So s1 has 22−1=3 choices. The same is true for s2 and for s3, and the choices are independent. So the number of plans is
3×3×3=27
In all there are 26=64 relations from S to T; the other 64−27=37 leave at least one server unlinked, for example {(s1,t1),(s2,t2)}, which leaves s3 out.
Why the other options are wrong
- (A) 63=26−1 counts every non-empty relation. A non-empty relation such as {(s1,t1)} leaves s2 and s3 unlinked.
- (C) 8=23 lets each server link to exactly one router. A server may be linked to both routers, as in {(s1,t1),(s1,t2),(s2,t1),(s3,t2)}.
- (D) 49=(23−1)2 swaps the roles: it makes each router choose a non-empty set of servers. The condition is on the servers.