6. a. Prove that a nonempty dag must have at least one source. b. How would you find a source (or determine that such a vertex does not exist) in a digraph represented by its adjacency matrix? What is the time efficiency of this operation? c. How would you find a source (or determine that such a vertex does not exist) in a digraph represented by its adjacency lists? What is the time efficiency of this operation?

Answer is in the photo. I can only upload it to a file hosting service. link below!

tinyurl.com/wtjfavyw

false

step-by-step explanation:

the reason i say this is because for a certain length of sides you can pick any two and the length is wither equal or greater than the third side and in this case it's not.

3 + 5 = 8

8 is smaller than 9 which is the third side.

hope this : )

answer: (yeees, you need a poet.)

//blooming serenity//

beautiful in the morning

mysterious at night

wonderous nature souring

with all it's mystical might

the flower that blooms

to the fox that looms

nocturnal creatures

with various features

a blooming flower soon in sight

as a new little hatchling fears to take flight  

afraid to leave it's calming nest,

but dear little bird, mother knows best

as sure as there are stars in the sky,

life is not about who, where what, when or why-

it's the journey that follows

adventures we swallow

of   nature's deep wonders,

natural disasters and storm's thunders.

blooming serenity

life and nature, truly is heavenly.

-kerstien lehman

step-by-step explanation: