that are separated by many hops) have a more tenuous coniccion for following question related to together (i.e., that are separated by just a few thops to deletion of nodes. the susceptibility of paths in commed in andected G=(V,E) contains two nodes s and t such that the distance between s and t is strictly greater than n/2. (a) Show that there must exist some node v not equal to either s or t such that deleting v from G destroys all stt paths. (In other words, the graph obtained from G by deleting v contains no path from s to t.) (b) Give an algorithm with running time O(m+n) to find such a node v