How would you show that a complete graph on Dijkstra and Kruskal algorithm has a quadratic complexity?

Could you clearly show and demonstrate how the quadratic (non linear) complexity could apply to one example for each of these graphs? thanks