How can we filter out numbers less than 2 in a number sequence to find prime numbers?
O We can test numbers less than 2 by checking if it is divisible by 2.
O We can have a conditional check to filter out numbers less than 2.
O Our code needs to throw an error if numbers less than 2 are given.
O We can have a predefined list of all prime numbers and check if the given number is inside that list.