Find the broadcast time of the dipper graph D_n,m, the graph that has n vertices and ( m(m1) / 2 ) + (n-m) edges containing a complete graph K_m and a path of length nm originated from a vertex of K_m. Indicate the worst originator(s). Also indicate the values of m (as a function of n) that maximizes and minimizes b(D_n,m) (as a function of n).