(2)Let G be a graph with m vertices. Describe two major drawbacks in the computer storage of G as its adjacency matrix A.
(10marks]
I

the smallest possible measurement of the width is 14 feet

step-by-step explanation:

let's assume length of parallelogram is 'l'

width of parallelogram is 'w'

the perimeter of a parallelogram must be no less than 40 feet

so, we get

we are given

length of parallelogram is 6 feet

so,

l=6

we can plug it

now, we can solve for w

subtract both sides by 12

divide both sides by 2

and we get

so,

the smallest possible measurement of the width is 14 feet

could u provide us some answer choices or hmm idk maybe a table for us to anser with ? ?

yes, whats the problem?