Prime numbers are natural numbers greater than 1 that have no positive divisors other than 1 and themselves. Determining whether a number is prime is a fundamental problem in number theory and has applications in various fields, including cryptography and computer science.

In this challenge, you will implement a function to check if a given number is prime. You will use logical operators and conditional statements to handle the multiple conditions required to identify a prime number efficiently.

Your task is to complete the function is_prime(n: u32) -> bool that takes an unsigned integer n and returns a boolean value indicating whether n is a prime number.

• The function should return true if n is a prime number and false otherwise.
• A prime number is a natural number greater than 1 that is not divisible by any number other than 1 and itself.
• Use logical operators and conditional statements to check the conditions for a prime number.
• Optimize the function to minimize unnecessary checks.

let result = is_prime(5);
assert_eq!(result, true);
 
let result = is_prime(4);
assert_eq!(result, false);

• Any number less than 2 is not prime.
• The number 2 is the only even prime number.
• For any other even number greater than 2, return false.
• Check divisibility starting from 3 up to the square root of the number.