GATE-2024-CS1(Forenoon)

Consider the following two regular expressions over the alphabet {0,1}:
r= 0^*+1^*
s=01^*+10^*
The total number of strings of length less than or equal to 5, which are neither in r nor in s, is _________