4 Show that, without use of Menger's theorem if agraph is 2- connected, then it contains two independent paths between two distinct vertices. 4 Show that, without use of Menger's theorem if agraph is 2- connected, then it contains two independent paths between two distinct vertices