Show that a simple directed graph whose vertices have maximum indegree and outdegree lower than [n] have two vertices with the same indegree and outdegree. Show that a simple directed graph whose vertices have maximum indegree and outdegree lower than [n] have two vertices with the same indegree and outdegree