Wd(3.2) Wd(3.3) Wd(3.4) Wd 4.2) Wd 4,3) Wd 4,4) 5. The windmill graph Wd(n, N) on N(n - 1+1 vertices is the connected simple graph formed by taking N copies of Kn and joining them at a common vertex. Some examples are above Prove the chromatic polynomial of the windmill graph Wd(n, V) IS K T:k-i)N Wd(3.2) Wd(3.3) Wd(3.4) Wd 4.2) Wd 4,3) Wd 4,4) 5. The windmill graph Wd(n, N) on N(n - 1+1 vertices is the connected simple graph formed by taking N copies of Kn and joining them at a common vertex. Some examples are above Prove the chromatic polynomial of the windmill graph Wd(n, V) IS K T:k-i)N