The correct answer is (c) 78
Explanation: Let, an n-path complement graph Pn’ is the graph complement of the path graph Pn. Since Pn is self-complementary, P4’ is isomorphic to P4. Now, Pn’ has an edge count = ^1⁄2(n-2)(n-1). So, the required edge count is=78.