Write an expression that results in the least significant byte of an integer x being preserved, but all other bits set to 1. For example: 0x98234493 becomes 0xFFFFFF93.

"Expression" means that you should write simple code that doesn't involve looping. Use bitwise operators like AND (&), OR(|), NOT(~), XOR(^), shift left logical (<<), shift right logical (>>>), shift right arithmetic (>>).You should try to solve each of these problems on paper before writing the code.

public class Puzzles {

public static int Q1(int x) { return 0;

}

}