What if it is a many$-$time pad?

Key: K

Ciphertext $1=$ message $1$ xor $K=1$ f$0$c$001745150501590$c$0015$

Ciphertext $2=$ message $2$ xor $K=131c07060011540d0015070112$

FAQ:

Submit the steps you used to learn $($your almost algorithm$).$

If you found the solution $($messages$),$ include that, else

Indicate how far you got and what ideas you had left for

what to try next.