Let s and t be positive integers with s≤t. Recall that Ps is the path graph on s vertices. Give a formula for the minimum number of edges that need to be removed from Kt so that it has a graph.
a) t−s
b) (2/t) −s
c) (2/t) −(2/s)
d) (2/t) +(2/s)