In graph theory, a complete graph on n vertices (typically denoted K,) is a special kind of graph in which every vertex is connected to every other vertex (other than tself. You can find pictures of K, through K, here Write a function that returns the adjacency matrix A for the complete graph K Hint: You can do this with one short line of code if you use the 'ones' and 'diag' functions You can find pictures of K2 through K, here Your Function C Reset MATLAB Documentation function A complete_graph(n) % computes the adjacency matrix for the complete graph K_n. send