To begin this question, start with the assumption that all graphs have a vertex-set, which is finite non-empty, in other terms, 1 s|U|<. do note that d can designate the degree of a vertex in an undirected graph furthermore and dow as respective in-degree out-degree being directed graph. let s="32," k="0." consider g="(V,E)" does not have self-loops with vertices where there cannot exist some two v s-1-k. claim if this is true or untrue provide proof claim. b digraph strongly connected for every we will din dou c which has even any edge were removed from would still be>