Suppose we start at time zero with some set of flowers. We can plant any two flowers together for 4 days; and at the end of the 4 days, a new flower will appear. A new flower is not immediately able to breed, but after 1 day it will be fully grown and can breed. We can move flowers freely and they will not wilt over time. Please formulate a linear program to minimize the time until all desired flowers are fully grown. Clearly define your variables. Data Given: N Tij d. number of types of flower in the game the type of flower that results when flowers of breeds i and j are bred together Vi, je 1,...,N the number of flowers of type i desired at the end of flower breeding Vi e 1, ..., N the number of flowers of type i owned at the start of flower breeding Vi 1,...,N Suppose we start at time zero with some set of flowers. We can plant any two flowers together for 4 days; and at the end of the 4 days, a new flower will appear. A new flower is not immediately able to breed, but after 1 day it will be fully grown and can breed. We can move flowers freely and they will not wilt over time. Please formulate a linear program to minimize the time until all desired flowers are fully grown. Clearly define your variables. Data Given: N Tij d. number of types of flower in the game the type of flower that results when flowers of breeds i and j are bred together Vi, je 1,...,N the number of flowers of type i desired at the end of flower breeding Vi e 1, ..., N the number of flowers of type i owned at the start of flower breeding Vi 1,...,N