Write a blueprint for the following Java class:

Write a driver that represents data for three statesHoney va $=$ new Honey$("$Virginia$",6000,79000,1975000)$;Honey az$=$ new Honey$("$Arizona$",26000,368000,2434000)$;Honey nc $=$ new Honey$("$NorthCarolina$",13000,104000,3468000)$;$$In the blueprint, the toString$()$ method prints out the fields, like it always should and the printExtra$()$ prints out the pounds per colony and dollars per colony $($see below$).$Have your program calculate and print out the fruit with the highest pounds per colony. $$Your output should look similar to mine. $$The last line needs to compare the lbsPerColony$()$ methods for the three objects to determine the smallest value. Make certain to declare variables for the three values that you are comparing so that your decision does not have repeated method calls $($ex double vaLbCol $=$ va$.$lbsPerColony$()$; $)$Sample output:$79000$ pounds of honey were produces in Virginia from $6000$ colonies and were valued at $$1,975,000\mathrm{.}00$The pounds per colony were $13$ and the dollars per pound were $$25\mathrm{.}00368000$ pounds of honey were produces in Arizona from $26000$ colonies and were valued at $$2,434,000\mathrm{.}00$The pounds per colony were $14$ and the dollars per pound were $$6\mathrm{.}61104000$ pounds of honey were produces in NorthCarolina from $13000$ colonies and were valued at $$3,468,000\mathrm{.}00$The pounds per colony were $8$ and the dollars per pound were $$33\mathrm{.}35$Arizona has the highest pounds produced per colony with a value of $14\mathrm{.}0$