Let G: K$->\{0,1\}"$ be a PRG such that from the last n$/2$ bits of G$($k$)$ it is easy to compute the first n$/2.$ Is G a secure PRG$?$ Why?