I think correct answer is option $(1),(3),(5)$ .
In RISC computer the fetch cycle looks like,
$1)MAR\leftarrow PC$
$2)MBR\leftarrow MEMORY[MAR]$
$3)IR\leftarrow MEMORY[MAR];PC\leftarrow PC+1$
So, PC is incremented in fetch stage only in RISC architecture.
If we think about option (2) it will fail in case of pipelining as if we increment PC in execute state then we have to keep ideal till execute stage comes to fetch new instruction which include more stall cycles and reduce efficiency of the pipeline . So option (2) is false .
Option (3) is not necessarily correct as counter example
$LDA $ $x$ [$x$ is a memory address]
Now in fetch cycle we already describe above .
Decode stage decode it from instruction register [$IR$] found it as a load instruction .
Instruction stage :-
$1)MAR\leftarrow X$
$2)MBR\leftarrow MEMORY[X]$
$3)AC\leftarrow MBR$
So, filling of accumulator done in execute stage .
option (5) is correct as in RISC all memory fetching operation generally done using load instructions .
https://www.robots.ox.ac.uk/~dwm/Courses/2CO_2014/2CO-N2.pdf