Can you give me another example that does the same thing as this code? It's a compression algorithm that takes an image and compresses it by taking every $5$th row and$/$or collumn and takes the average of the surrounding RGB elements.

from typing import List

def get$\_$grid$($x$,$ y$,$ row, col$)$:

return $[$

$[$r$,$ c$]$

for r$,$ c in $[$

$[$x $-1,$ y $-1],[$x $-1,$ y$],[$x $-1,$ y $+1],$

$[$x$,$ y $-1],[$x$,$ y$],[$x$,$ y $+1],$

$[$x $+1,$ y $-1],[$x $+1,$ y$],[$x $+1,$ y $+1]$

$]$

if $0<=$ r $<$ row and $0<=$ c $<$ col

$]$

def get$\_$average$($locations$,$ image$)$:

r $=$ sum$($image$[$i$][$j$][0]$ for i$,$ j in locations$)/$ len$($locations$)$

g $=$ sum$($image$[$i$][$j$][1]$ for i$,$ j in locations$)/$ len$($locations$)$

b $=$ sum$($image$[$i$][$j$][2]$ for i$,$ j in locations$)/$ len$($locations$)$

return $[$int$($r$),$ int$($g$),$ int$($b$)]$

def compress$($image$)$:

col $=$ len$($image$)$

row $=$ len$($image$[0])$

new$\_$image $=[]$

for x in range$(0,$ row, $5)$:

new$\_$row $=[]$

for y in range$(0,$ col, $5)$:

adjacent$\_$locations $=$ get$\_$grid$($x$,$ y$,$ row, col$)$

new$\_$color $=$ get$\_$average$($adjacent$\_$locations, image$)$

new$\_$row.append$($new$\_$color$)$

new$\_$image.append$($new$\_$row$)$

return new$\_$image

# Test case

test$\_$image $=[[[255,255,255]$ if $($r $\%2==$ c $\%2)$ else $[0,0,0]$ for c in range$(25)]$ for r in range$(25)]$

print$($f$"$Original image size: $\{$len$($test$\_$image$)\}$x$\{$len$($test$\_$image$[0])\}")$

compressed$\_$image $=$ compress$($test$\_$image$)$

print$($f$"$Compressed image size: $\{$len$($compressed$\_$image$)\}$x$\{$len$($compressed$\_$image$[0])\}$

$")$

print$($f$"$This is the test image:

$\{$test$\_$image$\}$

$")$

print$($f$"$This is the compressed image:

$\{$compressed$\_$image$\}")$