<span>A. Mechanical i think sorry if im wrong</span>
Answer:
For undirected graph n(n-1) for directed graph 
Explanation:
The maximum number of edges for a undirected graph is given by 
, where n is number of vertices
The maximum number of edges in directed graph is given by , where n is number of vertices
The maximum number of edges is greater in undirected graph than directed graph
Algorithm
STEP 1: START.
STEP 2: DEFINE n, i, j.
STEP 3: SET sum =0.
STEP 4: SET n =100.
STEP 5: REPEAT STEP 6 to STEP 10 UNTIL i<=n.
STEP 6: REPEAT STEP 7 and STEP 8 UNTIL j<=i/2.
STEP 7: if i%j ==0.
STEP 8: sum =sum + j.Algorithm
STEP 1: START.
STEP 2: DEFINE n, i, j.
STEP 3: SET sum =0.
STEP 4: SET n =100.
STEP 5: REPEAT STEP 6 to STEP 10 UNTIL i<=n.
STEP 6: REPEAT STEP 7 and STEP 8 UNTIL j<=i/2.
STEP 7: if i%j ==0.
STEP 8: sum =sum + j.
Option D
Firefighting is when network managers deal with network breakdowns and immediate problems instead of performing tasks according to a well laid out plan.
<h3><u>
Explanation:</u></h3>
Network management is a process of monitoring, operating and controlling the network. Various network managers spend most of their time firefighting- dealing with breakdowns and urgent problems.
If managers do not allocate enough time planning and organizing the network and networking staff, they are intended to be reactive rather than proactive in solving problems. A term that refers to reacting to network problems as they arise rather than relying on planned network management activity
I think it is picture/text wrapping
I wouldn’t trust this though
I’m sorry if it’s wrong
