[29] In a full-information shortest-path routing scheme, the routing function in u must, for every destination v, return all edges incident to u on shortest paths from u to v. These schemes allow alternative shortest paths to be taken whenever an outgoing link is down. Show that for full-information shortest-path routing on o(n)-random graphs, the local routing function requires n2/4−o(n2) bits for every node (hence the complete routing scheme requires at least n3/4 − o(n3) bits to be stored). This is also the trivial upper bound.