Erdős Problem #1187 — Monochromatic progressions constrained by primes

For each $k≥3$, does every finite colouring of the positive integers contain a monochromatic $k$-term arithmetic progression all of whose terms are prime? Does it contain a monochromatic $k$-term arithmetic progression whose common difference is prime?