Problem on optimization without constraint

$\newcommand{\bfA}{\mathbf{A}}$ $\newcommand{\bfB}{\mathbf{B}}$ $\newcommand{\bfC}{\mathbf{C}}$ $\newcommand{\bfF}{\mathbf{F}}$ $\newcommand{\bfI}{\mathbf{I}}$ $\newcommand{\bfa}{\mathbf{a}}$ $\newcommand{\bfb}{\mathbf{b}}$ $\newcommand{\bfc}{\mathbf{c}}$ $\newcommand{\bfd}{\mathbf{d}}$ $\newcommand{\bfe}{\mathbf{e}}$ $\newcommand{\bfi}{\mathbf{i}}$ $\newcommand{\bfj}{\mathbf{j}}$ $\newcommand{\bfk}{\mathbf{k}}$ $\newcommand{\bfn}{\mathbf{n}}$ $\newcommand{\bfr}{\mathbf{r}}$ $\newcommand{\bfu}{\mathbf{u}}$ $\newcommand{\bfv}{\mathbf{v}}$ $\newcommand{\bfw}{\mathbf{w}}$ $\newcommand{\bfx}{\mathbf{x}}$ $\newcommand{\bfy}{\mathbf{y}}$ $\newcommand{\bfz}{\mathbf{z}}$
Consider an open box with no top, as shown. The box has volume $32$ and dimensions $x,y,z$. Using the constraint to substitute for $z$, find the dimensions of the box with minimal surface area:
  1. What is the surface area of the box in terms of just $x$ and $y$?
  2. Using (a), find the values of $x$, $y$, $z$ that minimize the box's surface area.