Let u and u be distinct vertices of a nonseparable graph g of order n 3. if p is a u - path of g does there always exist a u - pathin g such that p and q are internally disjoint u - ally disjoint u o paths? i paths? [4]

let u and u be distinct vertices of a nonseparable graph g of order n 3. if p is a u - path of g graph g of order n

answer: list the statements and i will follow up!

step-by-step explanation:

b. 18

step-by-step explanation:

so the equation for this is:

ab^2=ac⋅ad

ab being the top length of 6 and ac being the length of 2 and ad being the length of x. let's plug into the equation:

6^2 = 2x

now lets just solve for x:

36 = 2x

18 = x

i hope that !