NEED ASAP PLEASE WILL GIVE GOOD RATE RIGHT AWAY FOR ALL ANSWERS!

just need true or false no justification please!!

TRUE FALSE | UNKNOWN: P is a subset of NP. TRUE FALSE : log(n) E O(log(vn) TRUE | FALSE: 23n E 0(32n) TRUE I FALSE: ? E 0(log2(n!)) TRUE I FALSE: Prim's Algorithm works correctly for graphs with negative weights. TRUE I FALSE : 4n E ?(5n) TRUE I FALSE : All DFS traversals of a given graph will have the same number of tree edges. TRUE | FALSE: A connected weighted graphs with non-distinct edge weights (at least two edges ha the same weight) must have more than one Minimum Weight Spanning Tree. TRUE I FALSE : log(Vn) E 0(log(n) TRUE | FALSE : Heap Sort is an in-place sort. TRUE | FALSE: All BFS traversals of a given graph will produce the same number of BFS trees TRUE I FALSE n't n + 1 E ?(n2)