Question $3$: Padding.

Prove that there exists a language LinDSPACE$(n)$ that is PSPACE $-$ Com$-$

plete. Specifically, it might be helpful considering the following language for

a wise choice of $k1$ and language $L$ :

PADDED $-L=\{($:$w,1^m$:$)$:$win{L}^{{?}^{?}}m|w{|}^k\}$