How to solve these kind of Modular Arithmetics situations?

Helloo…
Im kinda dumb in Discrete Mathematics since I just started studying it currently and I’m trying to figure out studying material to get remainders from operations like $11^{14^{4578369}}pmod {41}$ or $11^{3928454} pmod {3293}$. Can someone gimme hints or even the path to follow for their solutions?

I’ve tried using fermat’s little theorem but I couldn’t solve them anyway , cuz in the first case it’s kinda power from power situation and the other one the mod isn’t prime.

Note: Here’s a transcription of the exercises that uses these operations that im talking about. Thanks, though.

Considering $a=11^{3928454}$, $b=3293$ and $x$ as the
remainder from division of $a$ by $b$. Which is the addition of all
$x$ digits?
a. 1
b. 2
c. 4
d. 3

Considering
$a=11^{14^{4578369}}$ and $b=41$. Which is the remainder from division
of $a$ by $b$.
a.40
b.38
c.37
d.39

EXTRA NOTE: I don’t want the correct alternatives, I only want to figure out how to use Fermat’s Little theorem in these situations !!!!