Consider the following C code snippet, which computes the sum of squares of an array of integers and counts how many of these squares are even numbers.

$```$

#include

#define SIZE $10000$

int main$()\{$

int arr$[$SIZE$]$;

int sum$\_$of$\_$squares $=0$;

int even$\_$count $=0$;

$//$ Initialize the array

for $($int i $=0$; i $$ SIZE; i$++)\{$

arr$[$i$]=$ i $+1$;

$\}$

$//$ Calculate sum of squares and count even squares

for $($int i $=0$; i $$ SIZE; i$++)\{$

int square $=$ arr$[$i$]*$ arr$[$i$]$;

sum$\_$of$\_$squares $+=$ square;

if $($square $\%2==0)\{$

even$\_$count$++$;

$\}$

$\}$

printf$("$Sum of squares: $\%$d

$",$ sum$\_$of$\_$squares$)$;

printf$("$Count of even squares: $\%$d

$",$ even$\_$count$)$;

return $0$;

$\}$

$```$

Identify and explain at least three optimizations that could be applied to this code. Discuss the potential trade$-$offs of these optimizations regarding performance and code readability.