Thrashing At Half Full

An engineer adds shrinking to a dynamic array and picks the same threshold in both directions:

void resize(vec *v) {
  if (v->size == v->cap)            v->cap = v->size * 2;  /* grow   */
  else if (v->size * 2 <= v->cap)   v->cap = v->size;      /* shrink */
  else return;
  /* allocate cap slots, copy size elements, free the old block */
}

resize runs before every push and after every pop. Which workload turns $m$ operations into $\Theta(m \cdot n)$ total work, where $n$ is the element count?

$m/2$ push calls followed by $m/2$ pop calls.

push and pop alternating, once the array has just shrunk: each push grows and copies $n$ elements, each pop shrinks and copies them back.

$m$ consecutive push calls with no pop.

$m$ consecutive pop calls from a full array.