In AOE network, edge represent Select one: a. activity b. weight c. length d. time If p is a pointer to the node P in a linked list, the operations to delete P are Select one: a. p = p->next; free(p); b. p->next = p->next->next; free(p); c. free(p); d. none; The is a greedy algorithm. Select one: a. mergesort b. DFS search c. BFS search d. Prim's algorithm