(a) Suppose we know the probability of successful transmission along each link in a

network. Devise a routing algorithm that will allow us to find a route between any

two nodes with minimum total expected number of transmissions among all routes

between those two nodes.

(b) Consider a wireless network where a subset L of nodes have long communication

range while the remaining nodes, denoted by subset S, have short communication

range. Nodes in L are directly or indirectly (through multiple hops) connected to each

other. Nodes in S may or may not be connected to each other. However, every node

in S is connected directly or indirectly (through multiple hops) to at least one node in

L. Devise a routing mechanism for this network.